The arithmetic and Turing degrees are not elementarily equivalent (Q3765755): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributive Initial Segments of the Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfinite extensions of Friedberg's completeness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the First Order Theory of the Arithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneity and definability in the first-order theory of the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial segments of the degrees of unsolvability Part II: minimal degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:59, 18 June 2024

scientific article
Language Label Description Also known as
English
The arithmetic and Turing degrees are not elementarily equivalent
scientific article

    Statements

    The arithmetic and Turing degrees are not elementarily equivalent (English)
    0 references
    0 references
    1984
    0 references
    elementary theories
    0 references
    Turing degrees
    0 references
    arithmetic degrees
    0 references
    cone of degrees
    0 references
    second-order arithmetic
    0 references

    Identifiers