English
Related papers

Related papers: Can a small forcing create Kurepa trees?

200 papers

Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an $\omega_2$-Aronszajn tree, the $\omega_1$-approachability property fails, and every stationary subset of $\omega_2 \cap \mathrm{cof}(\omega)$…

Logic · Mathematics 2019-07-23 Thomas Gilton , John Krueger

We use generalizations of concepts from descriptive set theory to study combinatorial objects of uncountable regular cardinality, focussing on higher Kurepa trees and the representation of the sets of cofinal branches through such trees as…

Logic · Mathematics 2021-03-19 Philipp Lücke , Philipp Schlicht

We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…

Logic · Mathematics 2014-11-25 Charles Morgan

We show it is consistent with $\ZFC$ that there is an everywhere Kurepa line which is order isomorphic to all of its dense $\aleph_2$-dense suborders. Moreover, this Kurepa line does not contain any Aronszajn suborder. We also show it is…

Logic · Mathematics 2023-10-20 Hossein Lamei Ramandi

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

Logic · Mathematics 2007-05-23 Itay Neeman , Jindrich Zapletal

Assume $\lambda$ is a singular limit of $\eta$ supercompact cardinals, where $\eta \leq \lambda$ is a limit ordinal. We present two forcing methods for making $\lambda^+$ the successor of the limit of the first $\eta$ measurable cardinals…

Logic · Mathematics 2016-10-19 Mohammad Golshani

After stating several tools which can be used to construct indecomposable tree modules for quivers without oriented cycles, we use these methods to construct indecomposable tree modules for every imaginary Schur root. These methods also…

Representation Theory · Mathematics 2014-02-26 Thorsten Weist

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

Logic · Mathematics 2014-12-11 Julia Knight , Antonio Montalban , Noah Schweber

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

Logic · Mathematics 2015-06-15 Erin Carmody

We prove that it is consistent that Club Stationary Reflection and the Special Aronszajn Tree Property simultaneously hold on $\omega_2$, thereby contributing to the study of the tension between compactness and incompactness in set theory.…

Logic · Mathematics 2022-05-17 Omer Ben-Neria , Thomas Gilton

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

Logic · Mathematics 2023-12-29 Roy Shalev

Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…

Logic · Mathematics 2026-04-14 Mirna Džamonja

A mechanism for generating small tree-level Majorana mass for neutrinos is implemented in the 331 Model. No additional fermions or scalars need to be added, and no mass scale greater than a few TeV is invoked.

High Energy Physics - Phenomenology · Physics 2009-12-31 M. B. Tully , G. C. Joshi

Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated…

Combinatorics · Mathematics 2023-06-22 Daniel Birmajer , Juan B. Gil , David S. Kenepp , Michael D. Weiner

We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and…

Logic · Mathematics 2013-01-04 Tomek Bartoszynski , Andrzej Roslanowski

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

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…

Logic · Mathematics 2019-02-20 Chris Lambie-Hanson , Philipp Lücke

The idea of "vertex at the infinity" naturally appears when studying indecomposable injective representations of tree quivers. In this paper we formalize this behavior and find the structure of all the indecomposable injective…

Rings and Algebras · Mathematics 2012-01-12 E. Enochs , S. Estrada , S. Özdemir