English
Related papers

Related papers: Definable tree property for uncountable regular ca…

200 papers

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

Group Theory · Mathematics 2011-10-21 Maciej Malicki

Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…

Functional Analysis · Mathematics 2012-07-13 Jose Luis Gamez-Merino , Juan B. Seoane-Sepulveda

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…

Logic · Mathematics 2017-10-27 Philipp Lücke , Ralf Schindler , Philipp Schlicht

Our theme is that not every interesting question in set theory is independent of $ZFC$. We give an example of a first order theory $T$ with countable $D(T)$ which cannot have a universal model at $\aleph_1$ without CH; we prove in $ZFC$ a…

Logic · Mathematics 2009-09-25 Menachem Kojman , Saharon Shelah

We study ultrafilters on countable sets and reaping families which are indestructible by Sacks forcing. We deal with the combinatorial characterization of such families and we prove that every reaping family of size smaller than the…

Logic · Mathematics 2021-10-18 David Chodounský , Osvaldo Guzmán , Michael Hrušák

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

Logic · Mathematics 2024-11-20 James Holland

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

We deal with the existence of universal members in a given cardinality for several classes. First we deal with classes of Abelian groups, specifically with the existence of universal members in cardinalities which are strong limit singular…

Logic · Mathematics 2021-09-07 Saharon Shelah

Recent results of Hindman, Leader and Strauss and of Fern\'andez-Bret\'on and Rinot showed that natural versions of Hindman's Theorem fail {\em for all} uncontable cardinals. On the other hand, Komj\'ath proved a result in the positive…

Combinatorics · Mathematics 2025-06-12 Lorenzo Carlucci

A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. I give constructions of such trees which are both rigid (i.e. without non-trivial order-automorphisms) and uniform (in two…

Logic · Mathematics 2023-03-10 Sam Adam-Day

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Logic in Computer Science · Computer Science 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Logic · Mathematics 2025-09-15 Juan Pablo Aguilera , Joan Bagaria , Gabriel Goldberg , Philipp Lücke

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

Logic · Mathematics 2025-02-05 Alexander Van Abel

We characterize the compatibility of a collection of unrooted phylogenetic trees as a question of determining whether a graph derived from these trees --- the display graph --- has a specific kind of triangulation, which we call legal. Our…

Discrete Mathematics · Computer Science 2010-04-26 Sudheer Vakati , David Fernández-Baca

We force over the constructible universe to obtain a model of the $\Pi^1_3$-reduction property, thus lowering the best known large cardinal strength from the existence of $M_1^{\#}$ to just ZFC. In this model the $\Pi^1_3$-uniformization…

Logic · Mathematics 2026-04-15 Stefan Hoffelner

Starting with two supercompact cardinals we produce a generic extension of the universe in which a principle that we call ${\rm GM}^+(\omega_3,\omega_1)$ holds. This principle implies ${\rm ISP}(\omega_2)$ and ${\rm ISP}(\omega_3)$, and…

Logic · Mathematics 2019-05-21 Rahman Mohammadpour , Boban Velickovic

For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…

Discrete Mathematics · Computer Science 2009-09-29 R. R. Kamalian , V. V. Mkrtchyan

A wide Aronszajn tree is a tree of size $\aleph_1$ with no uncountable branches. Assuming the consistency of the existence of a weakly compact cardinal, we show the consistency of the existence of a wide Aronszajn tree that is…

Logic · Mathematics 2025-11-11 Siiri Kivimäki

Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the strong tree property at a regular cardinal $\kappa \geq \omega_2$…

Logic · Mathematics 2023-04-06 Chris Lambie-Hanson

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
‹ Prev 1 8 9 10 Next ›