English
Related papers

Related papers: An Inconsistent Forcing Axiom at $\omega_2$

200 papers

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

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

Logic · Mathematics 2009-09-25 Chaz Schlindwein

We continue the investigation of the question of whether the product of two countable Fr\'echet spaces must be M-separable. We are especially interested in this question in the presence of Martin's Axiom. The question has been shown to be…

General Topology · Mathematics 2025-07-03 Alan Dow

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

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…

Logic · Mathematics 2024-11-26 Tom Benhamou , Dima Sinapova

For $\chi^2-$tests with increasing number of cells, Cramer-von Mises tests, tests generated $\mathbb{L}_2$- norms of kernel estimators and tests generated quadratic forms of estimators of Fourier coefficients, we find necessary and…

Statistics Theory · Mathematics 2019-09-13 Mikhail Ermakov

It is shown that the existence of an $\omega$-compatible Einstein metric on a compact symplectic manifold $(M,\omega)$ imposes certain restrictions on the symplectic Chern numbers. Examples of symplectic manifolds which do not satisfy these…

Differential Geometry · Mathematics 2007-05-23 Tedi Draghici

A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…

Logic · Mathematics 2022-03-02 Noam Greenberg , Saharon Shelah

Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…

General Topology · Mathematics 2013-10-22 Marion Scheepers

We prove the consistency of $\binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+ \omega_1}{\mu\ \mu}$ where $\mu$ is a strong limit singular cardinal of countable cofinality. This result can be forced at limit of measurable cardinals and at small…

Logic · Mathematics 2021-02-02 Shimon Garti

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

Suppose $\kappa$ is a singular strong limit cardinal of countable cofinality and let $\langle \kappa_{n}: n<\omega \rangle$ be an incrasing sequence of regular cardinals cofinal in $\kappa$. We show that if $cf(2^\kappa)= \kappa^+$, then…

Logic · Mathematics 2021-07-12 Mohammad Golshani , Rahman Mohammadpour

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

We prove that the Sacks forcing collapses the continuum onto the dominating number d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses omega_2 then it forces…

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

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

Logic · Mathematics 2020-03-26 Dominik Adolf

Let $\kappa$ be an uncountable cardinal such that $2^{<\kappa} = \kappa$ or just ${\rm cf}(\kappa) > \omega$, $2^{2^{<\kappa}}= 2^\kappa$, and $([\kappa]^\kappa, \supseteq)$ collapses $2^\kappa$ to $\omega$. We show under these assumptions…

Logic · Mathematics 2019-03-06 Heike Mildenberger , Saharon Shelah

We define forcing orders which add witnesses to the failure of various forms of Friedman's Property. These posets behave similarly to the forcing order adding a nonreflecting stationary set but have the advantage of allowing the…

Logic · Mathematics 2024-11-05 Hannes Jakob

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ć

Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…

Logic · Mathematics 2018-05-23 David Aspero , Matteo Viale