English
Related papers

Related papers: Bounded forcing axioms and Baumgartner's conjectur…

200 papers

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

Logic · Mathematics 2018-11-14 James Cummings , Mirna Džamonja , Itay Neeman

Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…

Logic · Mathematics 2025-02-05 Miguel A. Cardona , Miroslav Repický , Saharon Shelah

Chang's Conjecture (CC) asserts that for every $F:[\omega_2]^{<\omega} \to \omega_2$, there exists an $X$ that is closed under $F$ such that $|X|=\omega_1$ and $|X \cap \omega_1| =\omega$. By classic results of Silver and Donder, CC is…

Logic · Mathematics 2019-08-30 Sean Cox , Saharon Shelah

We present a method which forces the failure of $\Pi^1_3$ and $\Sigma^1_3$-separation, while $\mathsf{MA} (\mathcal{I}$) holds, for $\mathcal{I}$ the family of indestructible ccc forcings. This shows that, in contrast to the assumption…

Logic · Mathematics 2025-11-05 Stefan Hoffelner

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

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

Logic · Mathematics 2017-02-10 Takayuki Kihara

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Logic · Mathematics 2019-03-08 Philip Welch

The weak boundedness property associated with a standard alpha-fractional Calderon-Zygmund operator and a weight pair is good-lambda controlled by the testing conditions and the Muckenhoupt and energy side conditions. As a consequence,…

Classical Analysis and ODEs · Mathematics 2016-09-27 Eric T. Sawyer , Chun-Yen Shen , Ignacio Uriarte-Tuero

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

Logic · Mathematics 2015-01-26 David Asperó , Miguel Angel Mota

In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…

Logic · Mathematics 2015-04-23 Grigoriy V. Bokov

The weak gravity conjecture suggests that, in a self-consistent theory of quantum gravity, the strength of gravity is bounded from above by the strengths of the various gauge forces in the theory. In particular, this intriguing conjecture…

General Relativity and Quantum Cosmology · Physics 2017-11-22 Shahar Hod

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

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…

Logic · Mathematics 2012-10-05 François G. Dorais

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

Logic · Mathematics 2025-08-26 David Asperó , Mohammad Golshani

In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

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

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

Logic in Computer Science · Computer Science 2018-05-01 Radu Iosif , Cristina Serban

The main purpose of this survey is to gather results on the boundedness of the Bergman projection. First, we shall go over some equivalent norms on weighted Bergman spaces $A^p_\omega$ which are useful in the study of this question. In…

Complex Variables · Mathematics 2015-01-19 José Ángel Peláez , Jouni Rättyä

We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah
‹ Prev 1 4 5 6 7 8 10 Next ›