Recursively Saturated Models of Set Theory

DOI10.2307/2042160zbMATH Open0455.03022OpenAlexW4238331523MaRDI QIDQ3902995FDOQ3902995

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

• Elementary induction on abstract structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparison of the axioms of local and universal choice
• Models with compactness properties relative to an admissible language
• Toward model theory through recursive saturation
• A guide to the identification of admissible sets above structures
• Title not available (Why is that?)
• Global and local choice functions
• A Generalized Kleene-Moschovakis Theorem
• Title not available (Why is that?)

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)