Recursively saturated nonstandard models of arithmetic

DOI10.2307/2273620MaRDI QIDQ3966138zbMATH OpenOpenAlexFDO

Authors Craig Smoryński

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

Barwise-Schlipf theoremconservativity resultscountable nonstandard models of arithmeticelementary extensionembeddabilityembedding theoremsexpandabilityreal typesrecursive typesshort modeluniqueness

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(19)

• Automorphisms of recursively saturated models of arithmetic
• Fixed points of self-embeddings of models of arithmetic
• Automorphisms of countable recursively saturated models of PA: A survey
• Set theoretical analogues of the Barwise-Schlipf theorem
• Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
• T-equivalences for positive sentences
• The complexity of classification problems for models of arithmetic
• Degrees of Recursively Saturated Models
• On cofinal extensions of models of arithmetic
• A certain class of models of Peano arithmetic
• Models of the alternative set theory
• Some remarks on initial segments in models of Peano arithmetic
• Extendible Sets in Peano Arithmetic
• Neutrally expandable models of arithmetic
• The Barwise-Schlipf theorem
• Models of positive truth
• Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
• Satisfaction is not absolute
• Nonstandard definability

This page was built for publication: Recursively saturated nonstandard models of arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966138)