Toward model theory through recursive saturation

DOI10.2307/2272817MaRDI QIDQ4196409zbMATH OpenOpenAlexFDO

Authors John S. Schlipf

Publication date 1978

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

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

zbMATH Keywords

Interpolation TheoremsCountable ModelsInfinitary LanguagesDefinability TheoremsRecursively Saturated ModelsResplendent Models

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Model theory of denumerable and separable structures (03C15) Computability and recursion theory (03D99) Logic on admissible sets (03C70)

Cited in

(18)

• Largest initial segments pointwise fixed by automorphisms of models of set theory
• BI-INTERPRETATION IN WEAK SET THEORIES
• Satisfaction is not absolute
• Local collection and end-extensions of models of compositional truth
• A note on the variety of satisfaction classes
• Full satisfaction classes, definability, and automorphisms
• Automorphisms of countable recursively saturated models of PA: A survey
• Rank-initial embeddings of non-standard models of set theory
• Recursively Saturated Models of Set Theory
• Automorphisms of models of arithmetic: a unified view
• Model theory of the regularity and reflection schemes
• Automorphisms of recursively saturated models of arithmetic
• Peano Corto and Peano Basso: a study of local induction in the context of weak theories
• Generalizing classical and effective model theory in theories of operations and classes
• Definable sets and expansions of models of Peano arithmetic
• Minimal elementary extensions of models of set theory and arithmetic
• Barwise: Infinitary Logic and Admissible Sets
• Condensable models of set theory

This page was built for publication: Toward model theory through recursive saturation

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