Cover Image

Ramsey-like theorems and immunities

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mimouni, Ahmed, Patey, Ludovic
Format:	Preprint
Published:	2025
Subjects:	Logic 03B30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Ramsey-like theorems for separable permutations
by: Houérou, Quentin Le, et al.
Published: (2025)

Open questions about Ramsey-type statements in reverse mathematics
by: Patey, Ludovic
Published: (2015)

Bounded Ramsey's theorem for triples in computability theory
by: Patey, Ludovic, et al.
Published: (2026)

The reverse mathematics of bounded Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2025)

$Π^0_4$ conservation of Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2024)

Ramsey-like theorems for the Schreier barrier
by: Carlucci, Lorenzo, et al.
Published: (2024)

$Π^0_4$ conservation of the Ordered Variable Word theorem
by: Houérou, Quentin Le, et al.
Published: (2024)

The reverse mathematics of the pigeonhole hierarchy
by: Houérou, Quentin Le, et al.
Published: (2024)

Largeness notions and polytime translation for $\forall Σ^0_3$-consequences of $\mathsf{RT}^2_2$
by: Houérou, Quentin Le, et al.
Published: (2026)

The strength of Ramsey's theorem for $α$-large sets
by: Carlucci, Lorenzo, et al.
Published: (2026)

On sequential theorems in Reverse Mathematics
by: Normann, Dag, et al.
Published: (2024)

Approximation theorems throughout Reverse Mathematics
by: Sanders, Sam
Published: (2023)

Weihrauch reducibility between Ramsey-type theorems and well-ordering principles at the level of $Σ^0_2$-induction: A pilot study
by: Carlucci, Lorenzo, et al.
Published: (2025)

There is No Composition in the Computable Reducibility Degrees
by: Mourad, Daniel
Published: (2024)

Independence and Induction in Reverse Mathematics
by: Belanger, David, et al.
Published: (2024)

The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
by: Cipriani, Vittorio, et al.
Published: (2022)

First-Order Modal Logic via Logical Categories
by: Ghilardi, Silvio, et al.
Published: (2025)

The cohesive and stable Ramsey theorems and proof size over a weak base theory
by: Kołodziejczyk, Leszek Aleksander, et al.
Published: (2026)

The adjacent Hindman's theorem and the $\mathbb Z$-Ramsey's theorem
by: Aceves-Martínez, Bruno Fernando, et al.
Published: (2024)

Arrow's theorem, ultrafilters, and reverse mathematics
by: Eastaugh, Benedict
Published: (2023)

On two recent extensions of the Big Five of Reverse Mathematics
by: Normann, Dag, et al.
Published: (2024)

A note on continuous functions on metric spaces
by: Sanders, Sam
Published: (2024)

Coding is hard
by: Sanders, Sam
Published: (2024)

A Reverse Mathematical Analysis of Hilbert's Nullstellensatz and Basis Theorem
by: Kulshreshtha, Dhruv
Published: (2024)

Connecting real and hyperarithmetical analysis
by: Sanders, Sam
Published: (2024)

Tarski's Undefinability Theorem and first-order arithmetic
by: Boyce, Stephen
Published: (2010)

Big in Reverse Mathematics: measure and category
by: Sanders, Sam
Published: (2023)

On countability and representations
by: Sanders, Sam
Published: (2026)

The uncountability of the reals and the Axiom of Choice
by: Normann, Dag, et al.
Published: (2026)

Independence questions in a finite axiom-schematization of first-order logic
by: Jubin, Benoit
Published: (2022)

The reverse mathematics of Brooks' theorem
by: Marcone, Alberto, et al.
Published: (2026)

Proof-Theoretic Relations between Higman's and Kruskal's theorem, and Independence Results for Tree-like Structures
by: Buriola, Gabriele, et al.
Published: (2025)

Development Processes
by: Gorbow, Paul
Published: (2025)

Generalized Schatunowsky theorem in a weak arithmetic
by: King, Hala, et al.
Published: (2025)

One Form of Successive Approximation Method and Choice Problem
by: Bulitko, Valeriy K.
Published: (2000)

A Reflection Principle for Potential Infinite Models of Type Theory
by: Eberl, Matthias
Published: (2024)

When Bi-interpretability implies Synonymy
by: Friedman, Harvey M., et al.
Published: (2025)

Avoiding logical strength in real analysis
by: Freund, Anton, et al.
Published: (2026)

Weak and Strong Versions of Effective Transfinite Recursion
by: Uftring, Patrick
Published: (2022)

On Nash-Williams' Theorem regarding sequences with finite range
by: Pakhomov, Fedor, et al.
Published: (2024)