Recursively saturated nonstandard models of arithmetic (Q3966138)

From MaRDI portal
Revision as of 05:23, 21 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Recursively saturated nonstandard models of arithmetic
scientific article

    Statements

    Recursively saturated nonstandard models of arithmetic (English)
    0 references
    0 references
    1981
    0 references
    countable nonstandard models of arithmetic
    0 references
    recursive types
    0 references
    real types
    0 references
    embeddability
    0 references
    uniqueness
    0 references
    embedding theorems
    0 references
    expandability
    0 references
    elementary extension
    0 references
    Barwise-Schlipf theorem
    0 references
    conservativity results
    0 references
    short model
    0 references

    Identifiers