English
Related papers

Related papers: Trees and gaps from a construction scheme

200 papers

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

Logic · Mathematics 2022-03-14 Rahman Mohammadpour

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

Group Theory · Mathematics 2024-02-23 Pierre-Emmanuel Caprace , Timothée Marquis , Colin D. Reid

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

I investigate the relationships between three hierarchies of reflection principles for a forcing class $\Gamma$: the hierarchy of bounded forcing axioms, of $\Sigma^1_1$-absoluteness and of Aronszajn tree preservation principles. The latter…

Logic · Mathematics 2023-06-22 Gunter Fuchs

Let $G$ be a graph and let $f$ be a positive integer-valued function on $V(G)$. In this paper, we show that if for all $S\subseteq V(G)$, $\omega(G\setminus S)<\sum_{v\in S}(f(v)-2)+2+\omega(G[S])$, then $G$ has a spanning tree $T$…

Combinatorics · Mathematics 2022-05-10 Morteza Hasanvand

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

Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…

Combinatorics · Mathematics 2018-02-16 Steve Butler , Misa Hamanaka , Marie Hardt

We investigate forcing and independence questions relating to construction schemes. We show that adding $\kappa\geq\omega_1$ Cohen reals adds a capturing construction scheme. We study the weaker structure of $n$-capturing construction…

Logic · Mathematics 2018-01-23 Damjan Kalajdzievski , Fulgencio Lopez

We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…

Logic · Mathematics 2016-06-10 John Krueger

For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…

Logic · Mathematics 2012-01-04 Jakob Kellner , Saharon Shelah

In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy…

Logic · Mathematics 2016-09-06 Renling Jin , Saharon Shelah

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

Logic · Mathematics 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

We construct a model in which the tree property holds in $\aleph_{\omega + 1}$ and it is destructible under $\text{Col}(\omega, \omega_1)$. On the other hand we discuss some cases in which the tree property is indestructible under small or…

Logic · Mathematics 2019-04-30 Yair Hayut , Menachem Magidor

We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…

Logic · Mathematics 2007-05-23 Alex Hellsten , Tapani Hyttinen , Saharon Shelah

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

Group Theory · Mathematics 2013-11-21 Volker Diekert , Armin Weiß

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

In a previous paper I proposed a notion of $(\omega_1,\beta)$-morasses for $\omega_1 \leq \beta$. In the present paper such morasses are constructed in an inner model which satisfies amenability, coherence and condensation.

Logic · Mathematics 2011-07-26 Bernhard Irrgang
‹ Prev 1 2 3 10 Next ›