Related papers: A more general iterable condition ensuring aleph_1…
Shelah's own proof to his recent polarized partition theorem involving a singular strong limit that violates the GCH is presented. The proof is slightly re-arranges so that no use of the ideal I[\lambda] is made. The proof should be…
Some new sufficient conditions for the weighted Chebyshev's inequality for real numbers to hold are provided.
This is a revised version (of late 2020) of [Sh:700], which is arXiv:math/0012170 . First point is noting that the proof of Theorem 4.3 in [Sh:700], which says that the proof giving the consistency $ \mathfrak{b} = \mathfrak{d} =…
We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…
Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…
Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the…
We present and analyze $F_\sigma$-Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as $\mathsf{ACA}_0$ and…
Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
We construct a model in which the tree property holds in $\aleph_{\omega + 1}$ and it is destructible under $\text{Col}(\omega, \omega_1)$. On the other hand we discuss some cases in which the tree property is indestructible under small or…
We solve two long-standing open problems regarding the combinatorics of $\aleph_{\omega+1}$. We answer a question of Shelah by showing that it is consistent for any $n\geq 1$ that $\mathsf{GCH}$ holds and there is a stationary set of points…
Shelah-Woodin investigate the possibility of violating instances of $GCH$ through the addition of a single real. In particular they show that it is possible to obtain a failure of $CH$ by adding a single real to a model of $GCH$, preserving…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
We examine the existence (and mostly non-existence) of fresh sets in commonly used iterations of Prikry type forcing notions. Results of [4] are generalized. As an application, a question of a referee of [9] is answered. In addition…
We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…
We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…
We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…
The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…
We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…