English
Related papers

Related papers: A game-theoretic proof of Shelah's theorem on labe…

200 papers

We analyze a natural function definable from a scale at a singular cardinal, and using this function we are able to obtain quite strong negative square-brackets partition relations at successors of singular cardinals. The proof of our main…

Logic · Mathematics 2008-06-02 Todd Eisworth

We show that in the $\mathbb{P}_{\max}$ extension of a certain Chang-type model of determinacy, if $\kappa\in\{\omega_1, \omega_2, \omega_3\}$, then the restriction of the club filter on $\kappa\cap\mathrm{Cof}(\omega)$ to HOD is an…

Logic · Mathematics 2025-07-01 Navin Aksornthong , Takehiko Gappo , James Holland , Grigor Sargsyan

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

Logic · Mathematics 2015-08-31 Paul Larson , Paul McKenney

We study model theoretic tree properties ($\text{TP}, \text{TP}_1, \text{TP}_2$) and their associated cardinal invariants ($\kappa_{\text{cdt}}, \kappa_{\text{sct}}, \kappa_{\text{inp}}$, respectively). In particular, we obtain a…

Logic · Mathematics 2016-10-24 Artem Chernikov , Nicholas Ramsey

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa.$ We prove that if there is a model of $\ZFC$ with two supercompact cardinals, then there is a model of \ZFC where…

Logic · Mathematics 2011-12-15 Laura Fontanella

We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples…

Formal Languages and Automata Theory · Computer Science 2012-06-15 Alexander Kartzow , Paweł Parys

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

Combinatorics · Mathematics 2020-04-14 Ali Chouria , Vlad-Florin Drǎgoi , Jean-Gabriel Luque

Answering one of the main questions of [FHK14, Chapter 7], we show that there is a tight connection between the depth of a classifiable shallow theory $T$ and the Borel rank of the isomorphism relation $\cong^\kappa_T$ on its models of size…

Logic · Mathematics 2020-04-07 Francesco Mangraviti , Luca Motto Ros

Recent results of Hindman, Leader and Strauss and of the second author and Rinot showed that some natural analogs of Hindman's Theorem fail for all uncountable cardinals. Results in the positive direction were obtained by Komj\'ath, the…

Combinatorics · Mathematics 2025-06-12 Lorenzo Carlucci , David J. Fernández-Bretón

For infinite cardinals $\kappa,\lambda$ let $C(\kappa,\lambda)$ denote the class of all compact Hausdorff spaces of weight $\kappa$ and size $\lambda$. So $C(\kappa,\lambda)=\emptyset$ if $\kappa>\lambda$ or $\lambda>2^\kappa$. If F is a…

General Topology · Mathematics 2025-12-17 Gerald Kuba

We show that for every homomorphism $\Gamma^+ \to S$ where $S$ is a finite semigroup there exists a factorization forest of height $\leq 3 \abs{S}$. The proof is based on Green's relations.

Logic in Computer Science · Computer Science 2007-10-29 Manfred Kufleitner

A classical theorem of Malykhin says that if $\{X_\alpha:\alpha\leq\kappa\}$ is a family of compact spaces such that $t(X_\alpha)\leq \kappa$, for every $\alpha\leq\kappa$, then $t\left( \prod_{\alpha\leq \kappa} X_\alpha \right)\leq…

General Topology · Mathematics 2023-07-14 Mikołaj Krupski

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…

Combinatorics · Mathematics 2016-01-20 Stephan Wagner

Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.

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

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $< C_\alpha | \alpha < \lambda^+ >$ with the following remarkable guessing property:…

Logic · Mathematics 2011-05-17 Assaf Rinot

Given two infinite cardinals $\kappa$ and $\lambda$, we introduce and study the notion of a $\kappa$-barely independent family over $\lambda.$ We provide some conditions under which these types of families exist. In particular, we relate…

Logic · Mathematics 2025-07-24 Jorge Antonio Cruz Chapital

We study the existence and cardinality of universal families for classes of rayless graphs. It is known, by a result of Diestel, Halin, and Vogler, that the class of countable rayless graphs does not admit a countable universal family,…

Combinatorics · Mathematics 2025-12-18 Leandro Fiorini Aurichi , Guilherme Eduardo Pinto

It is shown that if T is stable unsuperstable, and aleph_1< lambda =cf(lambda)< 2^{aleph_0}, or 2^{aleph_0} < mu^+< lambda =cf(lambda)< mu^{aleph_0} then T has no universal model in cardinality lambda, and if e.g. aleph_omega < 2^{aleph_0}…

Logic · Mathematics 2016-09-06 Menachem Kojman , Saharon Shelah