Toward model theory through recursive saturation

DOI10.2307/2272817zbMath0409.03019OpenAlexW1992704116MaRDI QIDQ4196409

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) Computability and recursion theory (03D99) Model theory of denumerable and separable structures (03C15) Logic on admissible sets (03C70)

Related Items (17)

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

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