English
Related papers

Related papers: $\Sigma_n$-correct Forcing Axioms

200 papers

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

Logic · Mathematics 2015-06-23 Diego Alejandro Mejía

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

Logic · Mathematics 2026-03-16 Curial Gallart

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…

Logic · Mathematics 2012-08-06 Justin Tatch Moore

Assuming the existence of a strong cardinal and a measurable cardinal above it, we construct a model of $ZFC$ in which for every singular cardinal $\delta$, $\delta$ is strong limit, $2^\delta=\delta^{+3}$ and the tree property at…

Logic · Mathematics 2018-05-22 Mohammad Golshani

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

Logic · Mathematics 2007-05-23 Itay Neeman , Jindrich Zapletal

Suppose $\kappa$ is $\lambda$-supercompact witnessed by an elementary embedding $j:V\rightarrow M$ with critical point $\kappa$, and further suppose that $F$ is a function from the class of regular cardinals to the class of cardinals…

Logic · Mathematics 2013-11-05 Brent Cody , Sy-David Friedman , Radek Honzik

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…

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

The problem to be solved in this paper is to construct a general method of proving whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandhi's fixed point theorem. The classical…

Computational Complexity · Computer Science 2021-06-18 Andrey Nechesov

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

Logic · Mathematics 2024-05-22 Vera Fischer , Corey Bacal Switzer

In 1988, Sibe Marde\v{s}i\'{c} and Andrei Prasolov isolated an inverse system $\mathbf{A}$ with the property that the additivity of strong homology on any class of spaces which includes the closed subsets of Euclidean space would entail…

Logic · Mathematics 2021-07-01 Jeffrey Bergfalk , Chris Lambie-Hanson

Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…

Logic · Mathematics 2018-01-30 Gabriel Goldberg

The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…

Combinatorics · Mathematics 2025-03-04 Javad B. Ebrahimi , Babak Ghanbari

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

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

Consider a compact metric space $X$, and let $\mathcal{F}=\{f_1,\,f_2,\ldots,\, f_k\}$ be a set of contracting and continuous self maps on $X$. Let $\Sigma$ be a sub-shift on $k$ symbols, and let $\Sigma_k$ be the full shift. Define…

Dynamical Systems · Mathematics 2024-06-25 Dawoud Ahmadi Dastjerdi , Sedigheh Darsaraee

For an arbitrary forcing class $\Gamma$, the $\Gamma$-fragment of Todorcevic's strong reflection principle SRP is isolated in such a way that (1) the forcing axiom for $\Gamma$ implies the $\Gamma$-fragment of SRP, (2) the stationary set…

Logic · Mathematics 2020-09-15 Gunter Fuchs

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…

History and Overview · Mathematics 2025-02-18 Frank Quinn

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

Logic · Mathematics 2026-05-05 Radek Honzik

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

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
‹ Prev 1 4 5 6 7 8 10 Next ›