On Mathias generic sets

DOI10.1007/978-3-642-30870-3_14MaRDI QIDQ2904402zbMATH OpenOpenAlexFDO

Authors Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1201.6084

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55) Other aspects of forcing and Boolean-valued models (03E40)

Abstract: 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 $ngeq3$ then it satisfies the jump property $G^{(n-1)}=G^{\prime }oplusemptyse{t}^{(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 $Ale{q}_{T}emptyse{t}^{(n-1)}$, computes a Cohen $n$-generic set.

Recommendations

• Generics for computable Mathias forcing
• Limits to joining with generics and randoms
• Genericity for Mathias forcing over general Turing ideals
• Relative recursive enumerability of generic degrees
• Notions of weak genericity

Cited in

(8)

• Generics for computable Mathias forcing
• On genericity and Ershov's hierarchy
• scientific article; zbMATH DE number 3885884 (Why is no real title available?)
• scientific article; zbMATH DE number 611097 (Why is no real title available?)
• Genericity for Mathias forcing over general Turing ideals
• Canonical immunity and genericity
• A problem by E. Landis and generic behavior of non-generic sets
• Limits to joining with generics and randoms

This page was built for publication: On Mathias generic sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904402)