Generics for computable Mathias forcing

DOI10.1016/j.apal.2014.04.011zbMath1320.03072OpenAlexW2136686133MaRDI QIDQ2453068

Theodore A. Slaman, Damir D. Dzhafarov, Jeffry L. Hirst, Peter A. Cholak

Publication date: 6 June 2014

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2014.04.011

zbMATH Keywords

computability theoryMathias forcingarithmetical forcingeffective forcingforcing and computability

Mathematics Subject Classification ID

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

Related Items (10)

The uniform content of partial and linear orders ⋮ Coloring trees in reverse mathematics ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Ramsey’s theorem for singletons and strong computable reducibility ⋮ Controlling iterated jumps of solutions to combinatorial problems ⋮ Genericity for Mathias forcing over general Turing ideals ⋮ Canonical immunity and genericity ⋮ Thin set theorems and cone avoidance ⋮ Pigeons do not jump high ⋮ On the degrees of constructively immune sets

Cites Work

• Unnamed Item
• Lowness for genericity
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• On Mathias Generic Sets
• Algorithmic Randomness and Complexity
• Notions of weak genericity
• Ramsey's theorem and cone avoidance
• Some Properties of Measure and Category
• Happy families
• Double jumps of minimal degrees
• On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
• Sets with no subset of higher degree
• Limits to joining with generics and randoms

This page was built for publication: Generics for computable Mathias forcing