English
Related papers

Related papers: There may be no minimal non $\sigma$-scattered lin…

200 papers

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

We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…

Logic · Mathematics 2026-03-13 Farmer Schlutzenberg

We solve a well--known problem in the theory of compact scattered spaces and superatomic boolean algebras by showing that, under GCH and for each regular cardinal $\kappa \geq \omega$, there is a poset $\mathcal P_\kappa$ preserving all…

Logic · Mathematics 2015-07-16 Miguel Angel Mota , William Weiss

We show that if a field A is not pseudo-finite, then there is no prime model of the theory of pseudo-finite fields over A. Assuming GCH, we generalise this result to \kappa-prime models, for \kappa a regular uncountable cardinal or…

Logic · Mathematics 2025-08-06 Zoé Chatzidakis

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…

Logic · Mathematics 2017-04-04 Philipp Lücke , Philipp Schlicht

We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…

Logic · Mathematics 2025-05-02 David Gonzalez , Matthew Harrison-Trainor

We prove that if ZF is consistent then ZFC+GCH is consistent with the following statement: There is for every k<omega a model of cardinality aleph_1 which is L_{infty,omega_1}-equivalent to exactly k non-isomorphic models of cardinality…

Logic · Mathematics 2007-05-23 Saharon Shelah , Pauli Vaisanen

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

Logic · Mathematics 2022-12-06 Dávid Uhrik

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

Logic · Mathematics 2021-03-09 Philipp Hieronymi , Erik Walsberg

We show that the consistency of $\mathrm{ZF} + \mathrm{AD}_{\mathbb{R}} + ``\Theta$ is measurable$"$ implies the consistency of $\mathrm{ZF} +``\Theta$ is the least strongly regular cardinal and the least measurable cardinal$"$ + $``$all…

Logic · Mathematics 2026-03-11 Rahman Mohammadpour , Otto Rajala , Sebastiano Thei

Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not…

Logic · Mathematics 2014-08-15 Tarek Sayed Ahmed

The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…

Logic · Mathematics 2016-05-23 Eric P. Astor , Damir D. Dzhafarov , Reed Solomon , Jacob Suggs

In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

We prove that for every Aronzsajn line A and every Countryman line C, there is a proper forcing extension in which A contains an isomorphic copy of either C or its converse C*. As a corollary, we obtain answers to several related questions…

Logic · Mathematics 2025-10-23 John Krueger , Justin Tatch Moore

We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.

Formal Languages and Automata Theory · Computer Science 2015-03-18 Zoltan Esik

Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.

Logic · Mathematics 2019-07-10 Mohammad Golshani , Yair Hayut

We contribute to the study of $\aleph_1$-dense sets of reals, a mainstay in set theoretic research since Baumgartner's seminal work in the 70s. In particular, we show that it is consistent with $\textsf{MA}$ that there exists an…

Logic · Mathematics 2025-12-25 Pedro Marun , Saharon Shelah , Corey Bacal Switzer

Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…

Logic · Mathematics 2023-01-10 Corey Bacal Switzer

Under MA we prove that for the ideal $\cal I$ of thin sets on $\omega$ and for any ordinal $\gamma \leq \omega_1$ there is an ${\cal I}$-ultrafilter (in the sense of Baumgartner), which belongs to the class ${\cal P}_{\gamma}$ of…

Logic · Mathematics 2012-01-10 Michał Machura , Andrzej Starosolski

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

Formal Languages and Automata Theory · Computer Science 2019-07-29 Kitti Gelle , Szabolcs Ivan