English
Related papers

Related papers: Subcomplete forcing, trees and generic absolutenes…

200 papers

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

We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…

Logic · Mathematics 2025-08-15 Hannes Jakob

We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with…

Logic · Mathematics 2016-11-28 Joerg Brendle

We construct a large family of normal $\kappa$-complete $\mathbb{R}_\kappa$-embeddable non-special $\kappa^+$-Aronszajn trees which have no club isomorphic subtrees using an instance of the proxy principle of Brodsky-Rinot.

Logic · Mathematics 2022-11-29 John Krueger

A $\kappa$-tree is said to be full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full $\kappa$-Souslin tree may consistently exist. Shelah gave an affirmative answer of height a strong limit…

Logic · Mathematics 2024-03-01 Assaf Rinot , Shira Yadai , Zhixing You

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

We introduce a variant of the Kurepa family. We then use one such family to construct a ccc indestructible property associated with a complete coherent Suslin tree $S$. Moreover, in every ccc forcing extension that preserves Suslin of $S$,…

Logic · Mathematics 2026-01-01 Yinhe Peng

Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komj\'ath and…

Logic · Mathematics 2011-09-29 Márton Elekes , Juris Steprāns

A wide Aronszajn tree is a tree of size $\aleph_1$ with no uncountable branches. Assuming the consistency of the existence of a weakly compact cardinal, we show the consistency of the existence of a wide Aronszajn tree that is…

Logic · Mathematics 2025-11-11 Siiri Kivimäki

We prove that it is consistent that there exists a Kurepa tree $T$ such that ${}^{\omega_1}2$ is a continuous image of the topological space $[T]$ consisting of all cofinal branches of $T$ with respect to the cone topologies. This result…

Logic · Mathematics 2025-07-03 John Krueger

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

The tree forcing method given by (Liu 2015) enables the cone avoiding of strong enumeration of a given tree, within a subset or co-subset of an arbitrary given set, provided the given tree does not admit computable strong enumeration. Using…

Logic · Mathematics 2019-12-20 Bjørn Kjos-Hanssen , Lu Liu

In this paper we give a metric construction of a tree which correctly identifies connected components of superlevel sets of $\mathbb{R}$-valued continuous functions $f$ on $X$ and show that it is possible to retrieve the $H_0$-persistent…

Algebraic Topology · Mathematics 2022-04-11 Daniel Perez

We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid…

Logic · Mathematics 2007-05-23 Gunter Fuchs , Joel David Hamkins

We give a forcing construction of the square principle on omega_1 using forcing with conditions whose domain is finite.

Logic · Mathematics 2016-08-14 Gregor K. Dolinar , Mirna Džamonja

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

Logic · Mathematics 2023-06-22 Natasha Dobrinen , Daniel Hathaway

Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.

Logic · Mathematics 2019-07-10 Mohammad Golshani , Yair Hayut

We show that certain type of tree forcings, including Sacks forcing, increases the covering of the strong measure zero ideal $\mathcal{SN}$. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which…

Logic · Mathematics 2019-02-06 Miguel A. Cardona , Diego A. Mejía , Ismael E. Rivera-Madrid

We investigate some versions of amoeba for tree-forcings in the generalized Cantor and Baire spaces. This answers [10, Question 3.20] and generalizes a line of research that in the standard case has been studied in [11], [13], and [7].…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi
‹ Prev 1 3 4 5 6 7 10 Next ›