ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES (Q4600467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice initial segments of the hyperdegrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing and reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining the Turing jump / rank
 
Normal rank

Revision as of 23:15, 14 July 2024

scientific article; zbMATH DE number 6824528
Language Label Description Also known as
English
ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES
scientific article; zbMATH DE number 6824528

    Statements

    ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES (English)
    0 references
    0 references
    11 January 2018
    0 references
    recursion theory
    0 references
    degree theory
    0 references
    hyperarithmetic degrees
    0 references
    arithmetic degrees
    0 references
    Kumabe-Slaman forcing
    0 references

    Identifiers