English
Related papers

Related papers: Ramsey's theorem and products in the Weihrauch deg…

200 papers

We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…

Logic in Computer Science · Computer Science 2023-12-05 Arno Pauly , Cécilia Pradic , Giovanni Solda

We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice. Our central results provide information on how Ramsey's theorem behaves under product, parallelization and jumps. From these results we can derive a…

Logic · Mathematics 2018-11-12 Vasco Brattka , Tahina Rakotoniaina

We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…

Logic in Computer Science · Computer Science 2024-09-05 Eike Neumann , Arno Pauly , Cécilia Pradic

We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…

Logic · Mathematics 2026-05-12 Leszek Aleksander Kołodziejczyk , Mengzhou Sun

We explore the relation between various versions of Ramsey theorem and bounding schemes in model ${N}$ of a fragment of arithmetic $F$. Our goal is to recast, in a different framework, and extend some results of Hirst \cite{Hirst-1987}, see…

Logic · Mathematics 2026-04-02 Peter Cholak

We study the reverse mathematics and computability-the\-o\-re\-tic strength of (stable) Ramsey's Theorem for pairs and the related principles COH and DNR. We show that SRT$^2_2$ implies DNR over RCA$_0$ but COH does not, and answer a…

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

We study the relations under Weihrauch reducibility of the well-ordering preservation principle for the operator $X \mapsto X^\omega$ and the Ordered Ramsey Theorem. Both principles are known to be equivalent to $\Sigma^0_2$-induction in…

Logic · Mathematics 2025-11-27 Lorenzo Carlucci , Giordano Celli

This paper is a contribution to the growing investigation of strong reducibilities between $\Pi^1_2$ statements of second-order arithmetic, viewed as an extension of the traditional analysis of reverse mathematics. We answer several…

Logic · Mathematics 2015-04-09 Damir D. Dzhafarov

The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the…

We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to $\mathrm{ATR_0}$ from the point of view of reverse mathematics, there is not a…

Logic · Mathematics 2023-06-22 Alberto Marcone , Manlio Valenti

An open question in reverse mathematics is whether the cohesive principle, $\COH$, is implied by the stable form of Ramsey's theorem for pairs, $\SRT^2_2$, in $\omega$-models of $\RCA$. One typical way of establishing this implication would…

Logic · Mathematics 2012-12-05 Damir D. Dzhafarov

In recent years, there has been a substantial amount of work in reverse mathematics concerning natural mathematical principles that are provable from $\RT$, Ramsey's Theorem for Pairs. These principles tend to fall outside of the "big five"…

Logic · Mathematics 2013-02-05 Manuel Lerman , Reed Solomon , Henry Towsner

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

Logic in Computer Science · Computer Science 2014-01-14 Stefano Berardi

In this article, we study a degenerate version of Ramsey's theorem for pairs and two colors ($\mathsf{RT}^2_2$), in which the homogeneous sets for color 1 are of bounded size. By $\mathsf{RT}^2_2$, it follows that every such coloring admits…

Logic · Mathematics 2025-09-05 Quentin Le Houérou , Ludovic Patey

Inspired by Ramsey's theorem for pairs, Rival and Sands proved what we refer to as an inside/outside Ramsey theorem: every infinite graph $G$ contains an infinite subset $H$ such that every vertex of $G$ is adjacent to precisely none, one,…

Logic · Mathematics 2021-09-17 Marta Fiori-Carones , Paul Shafer , Giovanni Soldà

In this paper we provide explicit dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and…

Combinatorics · Mathematics 2018-07-31 Dragan Mašulović

We construct an $\ll^2$-solution (also known as a weakly low solution) to ${\mathrm{D}^2}$ within ${\mathrm{B}\Sigma^0_{3}}$ and prove the $\ll^2$-basis theorem for $\mathrm{RT}^2$ over ${\mathrm{B}\Sigma^0_{3}}$. The $\ll^2$-basis theorem…

Logic · Mathematics 2026-01-13 Hiroyuki Ikari , Keita Yokoyama

We consider a Ramsey statement for pairs of maps between trees, where one is an embedding as defined by Deuber and the other is a rigid surjection as defined by Solecki. We show that there is no Ramsey Theorem for pairs of maps where the…

Combinatorics · Mathematics 2025-07-30 Sebastian Junge

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

Logic · Mathematics 2018-03-20 Ludovic Patey , Keita Yokoyama
‹ Prev 1 2 3 10 Next ›