On needed reals

Details On needed reals On needed reals

2001-04-28

arxiv.org/abs/math/0104276v1

Shelah [MdSh:725]

Mathematics

Logic

Scientific paper

Following Blass, we call a real a ``needed'' for a binary relation R on the reals if in every R-adequate set we find an element from which a is Turing computable. We show that every real needed for Cof(N) is hyperarithmetic. Replacing ``R-adequate'' by ``R-adequate with minimal cardinality'' we get related notion of being ``weakly needed''. We show that is is consistent that the two notions do not coincide for the reaping relation. (They coincide in many models.) We show that not all hyperarithmetical reals are needed for the reaping relation. This answers some questions asked by Blass at the Oberwolfach conference in December 1999.

Affiliated with

Also associated with

No associations

Rating

On needed reals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On needed reals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On needed reals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-298286