On constructible sets in Simpson's set theory

DOI10.1134/S0001434626603205MaRDI QIDQ7345823zbMATH OpenFDO

Authors Vladimir Kanovei, Vassily Lyubetsky

Publication date 10 September 2026

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0001434626603205

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) General topology (54-XX)

Cites work

• A survey of proof theory
• Constructibility
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis and A. S. Troelstra. Reprint
• scientific article; zbMATH DE number 3782998 (Why is no real title available?)
• scientific article; zbMATH DE number 473381 (Why is no real title available?)
• scientific article; zbMATH DE number 922633 (Why is no real title available?)
• scientific article; zbMATH DE number 3373752 (Why is no real title available?)
• Independence of the comprehension schema in second-order arithmetic from the parameter-free countable choice
• Lectures in set theory with particular emphasis on the method of forcing
• Non standard interpretations of higher order theories
• On the Semantics of the Constructible Levels
• Parameterfree comprehension does not imply full comprehension in second order Peano arithmetic
• Second order arithmetic and related topics
• Set Theory
• Subsystems of second order arithmetic
• Theory of Zermelo without power set axiom and the theory of Zermelo- Fraenkel without power set axiom are relatively consistent
• What is the theory ZFC without power set?
• ZFC without power set II: Reflection strikes back
• ω-models of second order arithmetic and admissible sets

This page was built for publication: On constructible sets in Simpson's set theory

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