A measure-theoretic proof of Turing incomparability (Q638476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Baire category theorem in weak subsystems of second-order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic characterizations of recursive infinite strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using random sets as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness notions, measure and domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing incomparability in Scott sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relative randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness properties and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure theory and weak König's lemma / rank
 
Normal rank

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references