Recursively Saturated Models of Set Theory

DOI10.2307/2042160MaRDI QIDQ3902995zbMATH OpenOpenAlexFDO

Authors John S. Schlipf

Publication date 1980

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

zbMATH Keywords

comprehensionnonstandard models of set theorywell founded parts of models

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Nonclassical and second-order set theories (03E70) Set-theoretic model theory (03C55) Axiomatics of classical set theory and its fragments (03E30) Nonstandard models (03H99)

Cites work

• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3534482 (Why is no real title available?)
• scientific article; zbMATH DE number 3598458 (Why is no real title available?)
• scientific article; zbMATH DE number 3222099 (Why is no real title available?)
• scientific article; zbMATH DE number 3370320 (Why is no real title available?)
• A Generalized Kleene-Moschovakis Theorem
• A guide to the identification of admissible sets above structures
• Comparison of the axioms of local and universal choice
• Elementary induction on abstract structures
• Global and local choice functions
• Models with compactness properties relative to an admissible language
• Toward model theory through recursive saturation

Cited in

(2)

• Set theoretical analogues of the Barwise-Schlipf theorem
• Condensable models of set theory

This page was built for publication: Recursively Saturated Models of Set Theory

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