English
Related papers

Related papers: A large Pi-1-2 set absolute for set forcing

200 papers

We prove a theorem on iterated forcing that can be used for preservation of $\aleph_2$ and $\aleph_1$ in iterations with supports of size $\aleph_1$ of forcings that have amalgamation properties similar to those present in the perfect set…

Logic · Mathematics 2026-03-24 Mirna Džamonja

We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor , Sy-David Friedman

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

Rings and Algebras · Mathematics 2014-02-26 Hung Le Pham

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

Logic · Mathematics 2009-09-25 Ralf Schindler

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

Logic · Mathematics 2012-09-19 Tapani Hyttinen , Vadim Kulikov

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

Logic · Mathematics 2017-08-08 Mohammad Golshani , Rahman Mohammadpour

Let G be a graph with a perfect matching. A complete forcing set of G is a subset of edges of G to which the restriction of every perfect matching is a forcing set of it. The complete forcing number of G is the minimum cardinality of…

Combinatorics · Mathematics 2021-02-09 Xin He , Heping Zhang

A forcing poset of size 2^{2^{aleph_1}} which adds no new reals is described and shown to provide a Delta^2_2 definable well-order of the reals (in fact, any given relation of the reals may be so encoded in some generic extension). The…

Logic · Mathematics 2007-05-23 Uri Abraham , Saharon Shelah

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Logic · Mathematics 2024-08-16 Asaf Karagila , Calliope Ryan-Smith

The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…

Logic · Mathematics 2007-05-23 Dmytro Taranovsky

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

Logic · Mathematics 2016-09-06 Boban Velickovic , W. Hugh Woodin

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

We deal with the problem of preserving various versions of completeness in (< kappa) --support iterations of forcing notions, generalizing the case ``S --complete proper is preserved by CS iterations for a stationary co-stationary S…

Logic · Mathematics 2016-09-07 Saharon Shelah

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…

Combinatorics · Mathematics 2012-08-06 Timothy G. F. Jones , Oliver Roche-Newton

We prove theorems of the following form: if $A\subseteq {\mathbb R}^2$ is a big set, then there exists a big set $P\subseteq {\mathbb R}$ and a perfect set $Q\subseteq {\mathbb R}$ such that $P\times Q\subseteq A$. We discuss cases where…

General Topology · Mathematics 2007-05-23 Szymon Zeberski

The determinacy of lightface $\Delta^1_{2n+2}$ and boldface $\boldsymbol{\Pi}^1_{2n+1}$ sets implies the existence of an $(\omega, \omega_1)$-iterable $M_{2n+1}^{\#}$.

Logic · Mathematics 2016-10-10 Yizheng Zhu

We will consider a number of new large-cardinal properties, the $\alpha$-tremendous cardinals for each limit ordinal $\alpha>0$, the hyper-tremendous cardinals, the $\alpha$-enormous cardinals for each limit ordinal $\alpha>0$, and the…

Logic · Mathematics 2021-03-10 Rupert McCallum

We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.

Logic · Mathematics 2018-09-05 Vladimir Kanovei , Vassily Lyubetsky

We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.

Logic · Mathematics 2013-01-28 Laura Fontanella