A measure-theoretic proof of Turing incomparability (Q638476): Difference between revisions
From MaRDI portal
Latest revision as of 10:21, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A measure-theoretic proof of Turing incomparability |
scientific article |
Statements
A measure-theoretic proof of Turing incomparability (English)
0 references
12 September 2011
0 references
The main result of this paper is that whenever \(A\) is a noncomputable set in an \(\omega\)-model of WWKL, there is another set \(B\) in the model which is Turing incomparable to \(A\). This theorem extends the similar result for \(\omega\)-models of WKL proved by \textit{A. Kučera} and \textit{T. A. Slaman} [``Turing incomparability in Scott sets'', Proc. Am. Math. Soc. 135, No. 11, 3723--3731 (2007; Zbl 1123.03039)], which answers a question of Friedman and McAllister; see [\textit{D. Cenzer} and \textit{C. G. Jockusch jun.}, ``\(\Pi^0_1\) classes -- structure and applications'', Contemp. Math. 257, 39--59 (2000; Zbl 0962.03040)]. The exposition includes a clear and concise discussion of genercity and randomness, relating these concepts to the main result.
0 references
computability theory
0 references
reverse mathematics
0 references
measure theory
0 references
randomness
0 references
Baire category theorem
0 references
forcing
0 references
genericity
0 references
WKL
0 references
WWKL
0 references
\(\omega\)-model
0 references
weak König's lemma
0 references
Turing degrees
0 references