Switch to: References

Add citations

You must login to add citations.
  1. Axiomatization and Forcing in Set Theory with Urelements.Bokai Yao - forthcoming - Journal of Symbolic Logic.
    In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms specifically concerning urelements. We prove that these axioms form a hierarchy over $\text {ZFCU}_{\text {R}}$ (ZFC with urelements formulated with Replacement) in terms of direct implication. The second part of the paper studies forcing over countable transitive models of $\text {ZFU}_{\text {R}}$. We propose a new (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Parameterfree Comprehension Does Not Imply Full Comprehension in Second Order Peano Arithmetic.Vladimir Kanovei & Vassily Lyubetsky - forthcoming - Studia Logica:1-16.
    The parameter-free part $$\textbf{PA}_2^*$$ of $$\textbf{PA}_2$$, second order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $$\omega $$ -model of $$\textbf{PA}_2^*+ \textbf{CA}(\Sigma ^1_2)$$, in which an example of the full Comprehension schema $$\textbf{CA}$$ fails. Using Cohen’s forcing, we also define an $$\omega $$ -model of $$\textbf{PA}_2^*$$, in which not every set has its complement, and hence the full $$\textbf{CA}$$ fails in a rather elementary way.
    Download  
     
    Export citation  
     
    Bookmark  
  • The σ1-definable universal finite sequence.Joel David Hamkins & Kameryn J. Williams - 2022 - Journal of Symbolic Logic 87 (2):783-801.
    We introduce the $\Sigma _1$ -definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, the sequence is $\Sigma _1$ -definable and provably finite; the sequence is empty in transitive models; and if M is a countable model of set theory in which the sequence is s and t is any finite extension of s in this model, then there is an end-extension of M to a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Initial self-embeddings of models of set theory.Ali Enayat & Zachiri Mckenzie - 2021 - Journal of Symbolic Logic 86 (4):1584-1611.
    By a classical theorem of Harvey Friedman, every countable nonstandard model $\mathcal {M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of $\mathcal {M}$ such that $j[\mathcal {M}]\subsetneq \mathcal {M}$, and the ordinal rank of each member of $j[\mathcal {M}]$ is less than the ordinal rank of each element of $\mathcal {M}\setminus j[\mathcal {M}]$. Here, we investigate the larger family of proper initial-embeddings j of models $\mathcal {M}$ of fragments of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The full basis theorem does not imply analytic wellordering.Vladimir Kanovei & Vassily Lyubetsky - 2021 - Annals of Pure and Applied Logic 172 (4):102929.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A good lightface Δ n 1 well-ordering of the reals does not imply the existence of boldface Δ n − 1 1 well-orderings.Vladimir Kanovei & Vassily Lyubetsky - 2024 - Annals of Pure and Applied Logic 175 (6):103426.
    Download  
     
    Export citation  
     
    Bookmark