A model theoretic proof of Feferman's preservation theorem

DOI10.1305/ndjfl/1093870626zbMath0566.03021OpenAlexW2076428131MaRDI QIDQ1059066

David Marker

Publication date: 1984

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093870626

zbMATH Keywords

end extensionrecursive saturationrecursively saturated modelfaithful extension

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Interpolation, preservation, definability (03C40) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15) Other classical first-order model theory (03C68)

Related Items

Elimination of unbounded quantifiers for some poly-regular groups of infinite rank ⋮ Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories ⋮ From Choosing Elements to Choosing Concepts: The Evolution of Feferman’s Work in Model Theory