Genericity for Mathias forcing over general Turing ideals

DOI10.1007/S11856-016-1420-8zbMATH Open1377.03031arXiv1505.02226OpenAlexW2962795890MaRDI QIDQ503254FDOQ503254

Authors: Peter A. Cholak, Damir D. Dzhafarov, Mariya I. Soskova 

Publication date: 11 January 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $maxD<minS$. The Turing degrees and computational characteristics of generics for this forcing in the special (but important) case where the infinite sets $S$ are computable were thoroughly explored by Cholak, Dzhafarov, Hirst, and Slaman~cite{CDHS-2014}. In this paper, we undertake a similar investigation for the case where the sets $S$ are members of general countable Turing ideals, and give conditions under which generics for Mathias forcing over one ideal compute generics for Mathias forcing over another. It turns out that if $mathcalI$ does not contain only the computable sets, then non-trivial information can be encoded into the generics for Mathias forcing over $mathcalI$. We give a classification of this information in terms of computability-theoretic properties of the ideal, using coding techniques that also yield new results about introreducibility. In particular, we extend a result of Slaman and Groszek and show that there is an infinite $Delt{a}_3^0$ set with no introreducible subset of the same degree.

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

Recommendations

• Generics for computable Mathias forcing
• On Mathias generic sets
• Deterministic genericity for polynomial ideals
• scientific article; zbMATH DE number 3848260
• scientific article; zbMATH DE number 5038454
• An axiomatic approach to forcing and generic extensions
• Generalized Prikry forcing and iteration of generic ultrapowers
• Generic absoluteness under projective forcing
• Mathias forcing and ultrafilters
• Some applications of the notions of forcing and generic sets

zbMATH Keywords

recursion theorycomputable Mathias forcingTuring ideals

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Other Turing degree structures (03D28) Other aspects of forcing and Boolean-valued models (03E40) Applications of set theory (03E75)

Cites Work

• Happy families
• On the strength of Ramsey's theorem for pairs
• Upward closure and cohesive degrees
• On the strength of Ramsey's theorem
• Turing computability. Theory and applications
• On degrees of recursive unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Generics for computable Mathias forcing
• A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\)
• Ramsey's theorem and cone avoidance
• Hyperarithmetically Encodable Sets
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• Uniformly introreducible sets
• Sets with no subset of higher degree

Cited In (5)

• On Mathias generic sets
• A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\)
• The uniform content of partial and linear orders
• Ramsey's theorem for singletons and strong computable reducibility
• Limits to joining with generics and randoms

This page was built for publication: Genericity for Mathias forcing over general Turing ideals

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