English
Related papers

Related papers: Strongly increasing sequences

200 papers

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

Logic · Mathematics 2026-05-28 Corentin Lagadec

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

Logic · Mathematics 2023-01-02 Daisuke Ikegami , Philipp Schlicht

We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $\omega_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not…

Logic · Mathematics 2022-06-06 Sean Cox , Philipp Lücke

In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…

Logic · Mathematics 2018-12-18 Alon Navon

Shelah has shown that there are no chains of length $\omega_3$ increasing modulo finite in ${}^{\omega_2}\omega_2$. We improve this result to sets. That is, we show that there are no chains of length $\omega_3$ in $[\omega_2]^{\aleph_2}$…

Logic · Mathematics 2022-10-05 Tanmay Inamdar

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

Logic · Mathematics 2008-11-07 Bernhard Irrgang

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz

We introduce a hierarchy of models of the Axiom of Determinacy called \emph{Nairian models}. Forcing over the simplest Nairian model, we obtain a model of ${\sf{ZFC}}+{\sf{MM^{++}}}(c)+\neg\square_{\omega_3}+\neg\square(\omega_3)$. Then,…

Logic · Mathematics 2025-02-03 Douglas Blue , Paul B. Larson , Grigor Sargsyan

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

Logic · Mathematics 2024-12-30 Rahman Mohammadpour , Boban Velickovic

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Logic · Mathematics 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

Logic · Mathematics 2016-06-10 John Krueger

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

Logic · Mathematics 2016-09-06 Garvin Melles

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

Logic · Mathematics 2022-03-14 Rahman Mohammadpour

We intend to contribute to the Collatz dynamics problem by seeking to analyze the Collatz conjecture from the tree of numbers sequences. First, we show numerically that the distribution of odd numbers has an initial transient, and proceeds…

General Mathematics · Mathematics 2023-05-26 Eduardo M. K. Souza

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

Logic · Mathematics 2023-06-22 Natasha Dobrinen , Daniel Hathaway

In the context of $\mathsf{ZF}+\mathsf{DC}$, we force $\mathsf{DC}_\kappa$ for relations on $\mathcal{P}(\kappa)$ for $\kappa{}<\aleph_\omega$ over the Chang model $\mathrm{L}(\mathrm{Ord}^\omega)$ making some assumptions on the thorn…

Logic · Mathematics 2024-04-01 James Holland , Grigor Sargsyan

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin
‹ Prev 1 2 3 10 Next ›