English
Related papers

Related papers: Creature forcing and large continuum: The joy of h…

200 papers

The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…

Probability · Mathematics 2010-04-27 Russell Lyons , Ron Peled , Oded Schramm

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…

Logic · Mathematics 2020-04-21 Gabriel Fernandes , Miguel Moreno , Assaf Rinot

We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…

Combinatorics · Mathematics 2026-05-11 Nguyen Hoang Dat , Franklin H. J. Kenter

We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…

Logic · Mathematics 2021-12-21 Sittinon Jirattikansakul

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

Logic · Mathematics 2025-04-14 Heike Mildenberger , Saharon Shelah

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

Logic · Mathematics 2022-12-22 Asaf Karagila , Jonathan Schilhan

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

Logic · Mathematics 2025-03-07 Francesco Parente , Matteo Viale

We show that $\mathsf{PFA}$ (Proper Forcing Axiom) implies that adding any number of Cohen subsets of $\omega$ will not add an $\omega_2$-Aronszajn tree or a weak $\omega_1$-Kurepa tree, and moreover no $\sigma$-centered forcing can add a…

Logic · Mathematics 2022-08-05 Radek Honzik , Chris Lambie-Hanson , Šárka Stejskalová

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one…

Logic · Mathematics 2018-03-06 Natasha Dobrinen , Dan Hathaway

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

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

Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a `supertree' that classifies all the taxa. In this paper, we ask how much coverage of the total set of…

Populations and Evolution · Quantitative Biology 2009-06-29 Mike Steel , Michael J. Sanderson

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

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 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

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil

We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…

Probability · Mathematics 2018-08-13 Erin Beckman , Natalie Frank , Yufeng Jiang , Matthew Junge , Si Tang