Condensable models of set theory

DOI10.1007/S00153-021-00786-3OpenAlexW3187852946MaRDI QIDQ2144608

Ali Enayat

Publication date: 14 June 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.04029

zbMATH Keywords

self-embeddinginfinitary languagesrecursive saturationnonstandard model of set theory

Mathematics Subject Classification ID

Axiomatics of classical set theory and its fragments (03E30) Models of arithmetic and set theory (03C62) Nonstandard models in mathematics (03H05)

Related Items (1)

Set theoretical analogues of the Barwise-Schlipf theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Rank-initial embeddings of non-standard models of set theory
• Nonstandard definability
• Model theory.
• Models of set theory with definable ordinals
• On Certain Elementary Extensions of Models of Set Theory
• Recursively Saturated Models of Set Theory
• An introduction to recursively saturated and resplendent models
• A Rather Classless Model
• Elementary extensions of countable models of set theory
• A guide to the identification of admissible sets above structures
• Models with compactness properties relative to an admissible language
• Models with second order properties II. Trees with no undefined branches
• Toward model theory through recursive saturation
• Counting models of set theory
• Set Theory
• INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY

This page was built for publication: Condensable models of set theory