On the complexity of models of arithmetic (Q3669417): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some independence results for Peano arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental logics and \(\Delta^0_2\)-theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3861306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5767299 / rank
 
Normal rank

Latest revision as of 09:07, 14 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of models of arithmetic
scientific article

    Statements

    On the complexity of models of arithmetic (English)
    0 references
    0 references
    1982
    0 references
    first-order Peano arithmetic
    0 references
    recursively enumerable extension of Peano arithmetic
    0 references
    initial segments
    0 references

    Identifiers