English
Related papers

Related papers: Some remarks on uncountable rainbow Ramsey theory

200 papers

In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…

Logic · Mathematics 2020-04-22 Radek Honzik , Sarka Stejskalova

For an inaccessible cardinal $\kappa$, the super tree property (ITP) at $\kappa$ holds if and only if $\kappa$ is supercomact. However, just like the tree property, it can hold at successor cardinals. We show that ITP holds at the successor…

Logic · Mathematics 2018-06-05 Sherwood Hachtman , Dima Sinapova

Let kappa a regular uncountable cardinal and lambda a cardinal >kappa, and suppose lambda^{<kappa} is less than the covering number for category cov(M_{kappa,kappa}). Then (a) I_{kappa,lambda}^+ -->^kappa (I_{kappa, lambda}^+,omega +1)^2,…

Logic · Mathematics 2007-05-23 Pierre Matet , Saharon Shelah

Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…

Logic · Mathematics 2021-10-08 Maxwell Levine , Heike Mildenberger

We both survey and extend a new technique from Lu Liu to prove separation theorems between products of Ramsey-type theorems over computable reducibility. We use this technique to show that Ramsey's theorem for $n$-tuples and three colors is…

Logic · Mathematics 2024-07-03 Julien Cervelle , William Gaudelier , Ludovic Levy Patey

Building on work of Holy, L\"ucke and Njegomir \cite{MR3913154} on small embedding characterizations of large cardinals, we use some classical results of Baumgartner (see \cite{MR0384553} and \cite{MR0540770}), to give characterizations of…

Logic · Mathematics 2021-02-22 Brent Cody

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 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

We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…

Combinatorics · Mathematics 2022-11-22 Matt Bowen

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…

Logic · Mathematics 2013-05-28 Brent Cody , Moti Gitik , Joel David Hamkins , Jason Schanker

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

Logic · Mathematics 2007-05-23 Bernhard Koenig

Much recent progress in hypergraph Ramsey theory has focused on constructions that lead to lower bounds for the corresponding Ramsey numbers. In this paper, we consider applications of these results to Gallai colorings. That is, we focus on…

Combinatorics · Mathematics 2019-02-05 Mark Budden , Joshua Hiller , Andrew Penland

We prove that for every uncountable cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, the quasi-order of embeddability on the $\kappa$-space of $\kappa$-sized graphs Borel reduces to the embeddability on the $\kappa$-space of…

Logic · Mathematics 2019-01-03 Filippo Calderoni

Generalizing some earlier techniques due to the second author, we show that Menas' theorem which states that the least cardinal kappa which is a measurable limit of supercompact or strongly compact cardinals is strongly compact but not…

Logic · Mathematics 2016-09-06 Arthur Apter , Saharon Shelah

We prove that, consistently, there exists a weakly but not strongly inaccessible cardinal $\lambda$ for which the sequence $\langle 2^\theta:\theta<\lambda\rangle$ is not eventually constant and the weak diamond fails at $\lambda$. We also…

Logic · Mathematics 2021-03-12 Shimon Garti , Saharon Shelah

Let $\mathrm{cof}(\mu)=\mu$ and $\kappa$ be a supercompact cardinal with $\mu<\kappa$. Assume that there is an increasing and continuous sequence of cardinals $\langle\kappa_\xi\mid \xi<\mu\rangle$ with $\kappa_0:=\kappa$ and such that, for…

Logic · Mathematics 2020-01-16 Alejandro Poveda

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

Logic · Mathematics 2020-07-10 Gabriel Goldberg

We give a combinatorial characterization of when a maximal almost disjoint family of a weakly compact cardinal $\kappa$ is indestructible by the higher random forcing $\mathbb Q_\kappa$. We then use this characterisation to show that…

Logic · Mathematics 2019-04-10 Thomas Baumhauer

In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…

Logic · Mathematics 2016-02-19 Ludovic Patey

If kappa is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which Diamond_kappa(REG) fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin,…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Mirna Džamonja