Determinacy and Δ^1_3-degrees

Details Determinacy and Δ^1_3-degrees Determinacy and Δ^1_3-degrees

1996-08-06

arxiv.org/abs/math/9608203v1

Mathematics

Logic

Scientific paper

Let D = { d_n } be a countable collection of Delta^1_3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have ``sharps''), we prove that either D has a Delta^1_3-minimal upper bound, or that for any n, and for every real r recursive in d_n, games in the pointclasses Delta^1_2(r) are determined. This is proven using Core Model theory.

Affiliated with

Also associated with

No associations

Rating

Determinacy and Δ^1_3-degrees 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 Determinacy and Δ^1_3-degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determinacy and Δ^1_3-degrees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193570