Recursively saturated nonstandard models of arithmetic

DOI10.2307/2273620zbMath0501.03044OpenAlexW2069613809MaRDI QIDQ3966138

Craig Smorynski

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273620

zbMATH Keywords

uniquenessembedding theoremsembeddabilityelementary extensionrecursive typesexpandabilitycountable nonstandard models of arithmeticBarwise-Schlipf theoremconservativity resultsreal typesshort model

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62)

Related Items

The Complexity of Classification Problems for Models of Arithmetic, Set theoretical analogues of the Barwise-Schlipf theorem, Automorphisms of countable recursively saturated models of PA: A survey, Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\), Neutrally expandable models of arithmetic, Nonstandard definability, Fixed points of self-embeddings of models of arithmetic, MODELS OF POSITIVE TRUTH, Automorphisms of recursively saturated models of arithmetic, The Barwise-Schlipf theorem, On cofinal extensions of models of arithmetic, Degrees of Recursively Saturated Models, T-EQUIVALENCES FOR POSITIVE SENTENCES, A certain class of models of Peano arithmetic, Extendible Sets in Peano Arithmetic, Models of the alternative set theory, Some remarks on initial segments in models of Peano arithmetic

Cites Work

• Model theory and algebra. A memorial tribute to Abraham Robinson
• Set theoretic foundations for constructive analysis
• On expandability of models of Peano arithmetic. II
• Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
• On models of arithmetic—Answers to two problems raised by H. Gaifman
• Models and types of Peano's arithmetic
• A guide to the identification of admissible sets above structures
• Models with compactness properties relative to an admissible language
• Models with second order properties II. Trees with no undefined branches
• Some independence results for Peano arithmetic
• On Languages Which are Based on Non-Standard Arithmetic
• On n-quantifier induction
• Relative Interpretations
• Eine Bemerkung zu Henkin's Beweis für die Vollständigkeit des Prädikatenkalküls der ersten Stufe