A measure-theoretic proof of Turing incomparability
From MaRDI portal
Publication:638476
DOI10.1016/j.apal.2010.07.004zbMath1227.03056MaRDI QIDQ638476
Publication date: 12 September 2011
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.2010.07.004
forcing; computability theory; reverse mathematics; measure theory; genericity; randomness; weak König's lemma; WKL; Baire category theorem; Turing degrees; \(\omega\)-model; WWKL
03F60: Constructive and recursive analysis
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
03D28: Other Turing degree structures
Cites Work
- On relative randomness
- Information-theoretic characterizations of recursive infinite strings
- Lowness properties and randomness
- Measure theory and weak König's lemma
- Lowness notions, measure and domination
- The Baire category theorem in weak subsystems of second-order arithmetic
- Turing incomparability in Scott sets
- Using random sets as oracles
- Degrees of Unsolvability. (AM-55)
- A unified approach to the definition of random sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item