On needed reals

Research paper by Heike Mildenberger, Saharon Shelah

Indexed on: 01 Dec '04Published on: 01 Dec '04Published in: Israel Journal of Mathematics


Given a binary relationR, we call a subsetA of the range ofR R-adequate if for everyx in the domain there is someyεA such that (x, y)εR. Following Blass [4], we call a realη ”needed” forR if in everyR-adequate set we find an element from whichη is Turing computable. We show that every real needed for inclusion on the Lebesgue null sets,Cof(\(\mathcal{N}\)), is hyperarithmetic. Replacing “R-adequate” by “R-adequate with minimal cardinality” we get the related notion of being “weakly needed”. We show that it is consistent that the two notions do not coincide for the reaping relation. (They coincide in many models.) We show that not all hyperarithmetic reals are needed for the reaping relation. This answers some questions asked by Blass at the Oberwolfach conference in December 1999 and in [4].