Toward model theory through recursive saturation
From MaRDI portal
Publication:4196409
DOI10.2307/2272817zbMath0409.03019MaRDI QIDQ4196409
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
Interpolation Theorems; Countable Models; Infinitary Languages; Definability Theorems; Recursively Saturated Models; Resplendent Models
03C50: Models with special properties (saturated, rigid, etc.)
03D99: Computability and recursion theory
03C15: Model theory of denumerable and separable structures
03C70: Logic on admissible sets
Related Items
Barwise: Infinitary Logic and Admissible Sets, BI-INTERPRETATION IN WEAK SET THEORIES, Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories, Largest initial segments pointwise fixed by automorphisms of models of set theory, 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, Automorphisms of models of arithmetic: a unified view, Model theory of the regularity and reflection schemes, Definable sets and expansions of models of Peano arithmetic, Automorphisms of recursively saturated models of arithmetic, Automorphisms of countable recursively saturated models of PA: A survey, Condensable models of set theory, Full satisfaction classes, definability, and automorphisms, A note on the variety of satisfaction classes, Local collection and end-extensions of models of compositional truth, Recursively Saturated Models of Set Theory
