On Mathias generic sets

Details On Mathias generic sets On Mathias generic sets

2012-01-29

arxiv.org/abs/1201.6084v2

Mathematics

Logic

Scientific paper

We present some results about generics for computable Mathias forcing. The $n$-generics and weak $n$-generics in this setting form a strict hierarchy as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing relation, and show that if $G$ is any $n$-generic with $n \geq 3$ then it satisfies the jump property $G^{(n-1)} = G' \oplus \emptyset^{(n)}$. We prove that every such $G$ has generalized high degree, and so cannot have even Cohen 1-generic degree. On the other hand, we show that $G$, together with any bi-immune set $A \leq_T \emptyset^{(n-1)}$, computes a Cohen $n$-generic set.

Affiliated with

Also associated with

No associations

Rating

On Mathias generic sets 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 Mathias generic sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Mathias generic sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358797