English
Related papers

Related papers: Introducing a nontrivial square_omega

200 papers

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

Logic · Mathematics 2024-04-24 Miloš S. Kurilić

Using a variation of Woodin's $\mathbb{P}_{\mathrm{max}}$ forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing sequence of length $\omega_{2}$ consisting of functions…

Logic · Mathematics 2026-04-01 Paul B. Larson , Chris Lambie-Hanson

In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [JR1] in which several problems were posed. We answer some of those problems here.

Logic · Mathematics 2009-09-25 Andrzej Rosłanowski , Saharon Shelah

We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and…

Logic · Mathematics 2013-01-04 Tomek Bartoszynski , Andrzej Roslanowski

In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…

Logic · Mathematics 2007-05-23 Joel David Hamkins

The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. This wisdom presumably does hold for…

Logic in Computer Science · Computer Science 2017-03-28 Naveen Sundar Govindarajulu , Selmer Bringsjord

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

Logic · Mathematics 2011-10-18 Bernhard Irrgang

We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…

Logic · Mathematics 2019-12-12 Ur Ya'ar

We show that $\mathsf{PFA}$ implies that the tightness $t(X_\delta)$ of the $G_\delta$-modification of a Fr\'echet $\alpha_1$-space $X$ is at most $\omega_1$, while $\Box(\kappa)$ implies that there is a Fr\'echet $\alpha_1$-space with…

General Topology · Mathematics 2019-10-24 William Chen-Mertens , Paul J. Szeptycki

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

Logic · Mathematics 2020-08-12 Corey Bacal Switzer

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

Logic · Mathematics 2008-10-30 Bernhard Irrgang

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Logic · Mathematics 2018-10-26 John Krueger

In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…

Logic in Computer Science · Computer Science 2020-04-21 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We consider techniques (based on an ultraviolet cutoff) used to prove that the pure boson ($\phi^4)_4$ field theory is trivial and apply them instead to the dynamically generated quark-level linear sigma model. This cutoff approach leads to…

High Energy Physics - Phenomenology · Physics 2011-09-13 L. R. Babukhadia , M. D. Scadron

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 give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

Logic · Mathematics 2019-12-03 Matteo Viale

We present S. Todorcevic's method of forcing with a coherent Souslin tree over restricted iteration axioms as a black box usable by those who wish to avoid its complexities but still access its power.

General Topology · Mathematics 2016-07-18 Franklin D. Tall

Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…

Logic · Mathematics 2023-01-06 Mohammad Golshani , Saharon Shelah

Given a Fra\"{i}ss\'{e} class $\mathcal{K}$ and an infinite cardinal $\kappa,$ we define a forcing notion which adds a structure of size $\kappa$ using elements of $\mathcal{K}$, which extends the Fra\"{i}ss\'{e} construction in the case…

Logic · Mathematics 2021-09-24 Mohammad Golshani