English
Related papers

Related papers: A forcing axiom deciding the generalized Souslin H…

200 papers

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Combinatorics · Mathematics 2008-12-04 Zhi-Wei Sun

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

Logic · Mathematics 2025-06-10 Slavica Mihaljevic Vlahovic , Branislav Dobrasin Vlahovic

This paper proves a conjecture by Solomon about Steiner shallow-light trees (SLT) in Euclidean $d$-space: It is shown that for any finite point set $\mathbb{R}^d$, any root, and any $\epsilon>0$, there is a Euclidean Steiner…

Computational Geometry · Computer Science 2026-05-27 Devin Frost , Kimberly Kokado , Csaba D. Tóth

Suppose there is a Reinhardt cardinal. Then (1) $M_n(X)$ exists and is fully iterable (above $X$) for every transitive set $X$ and every $n<\omega$ (here $M_n(X)$ denotes the canonical minimal proper class inner model containing $X$ and…

Logic · Mathematics 2024-02-07 Farmer Schlutzenberg

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

Number Theory · Mathematics 2025-08-22 Trey Smith , Aksel Ozer

We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…

Logic · Mathematics 2021-01-20 Matteo Viale

We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins

In this paper we consider the Foreman's maximality principle, which says that any non-trivial forcing notion either adds a new real or collapses some cardinals. We prove the consistency of some of its consequences. We prove that it is…

Logic · Mathematics 2016-04-05 Mohammad Golshani , Yair Hayut

Let $\lambda$ be a limit of Woodin cardinals. It was shown by the second author that the pointclass of ${<\lambda}$-homogeneously Suslin sets has the scale property. We give a new proof of this fact, which avoids the use of stationary tower…

Logic · Mathematics 2024-06-06 Farmer Schlutzenberg , John R. Steel

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

For many classes of models, there are universal members in any cardinal $\lambda$ which "essentially satisfies GCH", i.e. $\lambda = 2^{< \lambda}$, in particular for the class of a complete first order $T$ (well, if at least $\lambda >…

Logic · Mathematics 2026-03-05 Saharon Shelah

We prove that every weakly square compact cardinal is a strong limit cardinal. We also study Aronszajn trees with no uncountable finitely branching subtrees, characterizing them in terms of being Lindel\"of with respect to a particular…

Logic · Mathematics 2023-05-26 Pedro E. Marun

A cardinal lambda is called omega-inaccessible if for all mu < lambda we have mu^omega<lambda. We show that for every omega-inaccessible cardinal lambda there is a CCC (hence cardinality and cofinality preserving) forcing that adds a…

Logic · Mathematics 2007-05-23 Istvan Juhasz , Saharon Shelah

The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not depend on the nature of the (regular uncountable)…

Logic · Mathematics 2025-09-09 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

The longstanding conjecture of Halin characterizing the existence of normal spanning trees in infinite graphs has been recently proved by Max Pitz [3]. A critical step in the proof involves the construction of dominated torsos, whose…

Combinatorics · Mathematics 2026-03-31 Jerzy Wojciechowski

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

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

The purpose of this writing is to show that, if we use the definition of elementary $\infty$-topos that has been proposed by Mike Shulman, then the fact that every geometric $\infty$-topos satisfies the required axioms, more specifically…

Category Theory · Mathematics 2019-11-20 Giulio Lo Monaco

We propose a parameterized proxy principle from which $\kappa$-Souslin trees with various additional features can be constructed, regardless of the identity of $\kappa$. We then introduce the microscopic approach, which is a simple method…

Logic · Mathematics 2018-11-28 Ari Meir Brodsky , Assaf Rinot

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine