English
Related papers

Related papers: Sealed Kurepa Trees

200 papers

Assuming the existence of a strong cardinal $\kappa$, a weakly compact cardinal $\lambda$ above it and $\gamma > \lambda,$ we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any given cofinality $\delta$,…

Logic · Mathematics 2020-06-26 Mohammad Golshani , Alejandro Poveda

We show that the existence of an almost Souslin Kurepa tree is consistent with $ZFC$. We also prove their existence in $L$. These results answer two questions from Zakrzewski.

Logic · Mathematics 2015-10-13 Mohammad Golshani

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

We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we…

Logic · Mathematics 2021-06-15 Jonathan Schilhan

We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of…

Logic · Mathematics 2023-07-19 Rahman Mohammadpour

By an omega_1 --tree we mean a tree of power omega_1 and height omega_1. We call an omega_1 --tree a Jech--Kunen tree if it has kappa --many branches for some kappa strictly between omega_1 and 2^{omega_1}. In this paper we construct the…

Logic · Mathematics 2016-09-06 Renling Jin , 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

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Achim Blumensath

An $\mathbb R$-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying $\mathbb R$-trees be characterised by the fact that…

Logic · Mathematics 2022-06-22 Sam Adam-Day

We extend A. Miller's framework of $\alpha$-forcing to the case of a regular uncountable cardinal $\kappa = \kappa^{<\kappa}$ and apply it to study the structure of the $\kappa$-Borel hierarchy on subspaces of the generalized Baire space…

Logic · Mathematics 2026-03-10 Nick Chapman

In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

For uncountable downwards closed subtrees $U$ and $W$ of an $\omega_1$-tree $T$, we say that $U$ and $W$ are strongly almost disjoint if their intersection is a finite union of countable chains. The tree $T$ is strongly non-saturated if…

Logic · Mathematics 2025-09-09 John Krueger , Eduardo Martinez Mendoza

Motivated by the cabling of solar farms, we study the problem Constrained Layer Tree. At its core, it asks whether there exists a tree that connects a set of sources (the leaves) to one sink (the root) such that certain capacity constraints…

Data Structures and Algorithms · Computer Science 2024-10-22 Thomas Bläsius , Max Göttlicher , Sascha Gritzbach , Wendy Yi

We present several results that rely on arguments involving the combinatorics of "bushy trees". These include the fact that there are arbitrarily slow-growing diagonally noncomputable (DNC) functions that compute no Kurtz random real, as…

Logic · Mathematics 2017-03-22 Mushfeq Khan , Joseph S. Miller

In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of the generalised Cantor space and study its associated ideal of null sets and notion of measurability. This issue was…

Logic · Mathematics 2020-04-28 Sy David Friedman , Giorgio Laguzzi

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

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

We provide a description of the structure of $\aleph_0$-categorical trees and cycle-free partial orders. First the maximal branches of $\aleph_0$-categorical tree are examined, followed by the configuration of the ramification orders, which…

Logic · Mathematics 2015-03-13 Robert Barham

Copulas are a powerful tool for modeling multivariate distributions as they allow to separately estimate the univariate marginal distributions and the joint dependency structure. However, known parametric copulas offer limited flexibility…

Machine Learning · Statistics 2021-11-11 Tim Janke , Mohamed Ghanmi , Florian Steinke

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