Set theoretical analogues of the Barwise-Schlipf theorem

DOI10.1016/J.APAL.2022.103158OpenAlexW3035885693WikidataQ113880322 ScholiaQ113880322MaRDI QIDQ2159934

Ali Enayat

Publication date: 2 August 2022

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

forcingnonstandard modelsZermelo-Fraenkel set theoryrecursive saturationinfinitary languageGödel-Bernays class theory

Mathematics Subject Classification ID

Axiomatics of classical set theory and its fragments (03E30) Models of arithmetic and set theory (03C62) Logic on admissible sets (03C70) Nonstandard models (03H99)

Related Items (1)

Set theory with a proper class of indiscernibles

Cites Work

• Classes and truths in set theory
• Saturation and simple extensions of models of Peano arithmetic
• Model theory.
• Condensable models of set theory
• Recursively Saturated Models of Set Theory
• Recursively saturated nonstandard models of arithmetic
• A Rather Classless Model
• Models with second order properties II. Trees with no undefined branches
• The Barwise-Schlipf theorem
• Powers of regular cardinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Set theoretical analogues of the Barwise-Schlipf theorem