A hierarchy of formulas in set theory

DOI10.1090/memo/0057zbMath0202.30502OpenAlexW1991402517MaRDI QIDQ5599812

Azriel Levy

Publication date: 1965

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/memo/0057

Related Items (24)

End-extensions preserving power set ⋮ Ackermann's model and recursive predicates ⋮ Pure extensions, proof rules, and hybrid axiomatics ⋮ Unnamed Item ⋮ Strong unfoldability, shrewdness and combinatorial consequences ⋮ Absolute \(E\)-rings ⋮ \(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Cohomological Localizations and Set-Theoretical Reflection ⋮ Boolean-valued universe as an algebraic system. II: Intensional hierarchies ⋮ Absolute \(E\)-modules ⋮ A classical way forward for the regularity and normalization problems ⋮ Query languages for hierarchic databases ⋮ Ehrenfeucht-Fraïssé games in finite set theory ⋮ An application of set theory to model theory ⋮ Finiteness is not a \(\Sigma_0\)-property ⋮ A model of ZF with an infinite free complete Boolean algebra ⋮ Levy and set theory ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Model theory via set theory ⋮ Robinson forcing is not absolute ⋮ MODAL STRUCTURALISM AND REFLECTION ⋮ The Shoenfield absoluteness lemma ⋮ Maximal sets in \(\alpha\)-recursion theory ⋮ Rank-initial embeddings of non-standard models of set theory

This page was built for publication: A hierarchy of formulas in set theory