The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable (Q5037208): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES / 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: Decidability and Invariant Classes for Degree Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursive unsolvability / rank
 
Normal rank

Latest revision as of 04:17, 28 July 2024

scientific article; zbMATH DE number 7481736
Language Label Description Also known as
English
The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable
scientific article; zbMATH DE number 7481736

    Statements

    The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable (English)
    0 references
    0 references
    28 February 2022
    0 references
    0 references
    recursion theory
    0 references
    hyperarithmetic theory
    0 references