Cover Image

The Galvin-Prikry Theorem in the Weihrauch lattice

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Marcone, Alberto, Osso, Gian Marco
Format:	Preprint
Published:	2024
Subjects:	Logic 03D78, 03B30, 03D30, 05C55
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The tree pigeonhole principle in the Weihrauch degrees
by: Dzhafarov, Damir, et al.
Published: (2023)

Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, 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)

A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)

Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)

Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
Published: (2024)

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)

Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)

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

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)

The finite cohesiveness principle
by: Sun, Mengzhou
Published: (2025)

A topos for extended Weihrauch degrees
by: Maschio, Samuele, et al.
Published: (2025)

Sequential discontinuity and first-order problems
by: Pauly, Arno, et al.
Published: (2024)

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

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

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

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

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

Axiom Beta Implies Elementary Transfinite Recursion
by: Frittaion, Emanuele, et al.
Published: (2026)

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

A complicated family of trees with omega + 1 levels
by: Shelah, Saharon
Published: (2014)

More on the indivisibility of $\mathbb{Q}$
by: Pauly, Arno
Published: (2024)

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

The weakness of finding descending sequences in ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2024)

Finding descending sequences through ill-founded linear orders
by: Goh, Jun Le, et al.
Published: (2020)

More conservativity for weak Kőnig's lemma
by: Freund, Anton, et al.
Published: (2024)

Embeddability of graphs and Weihrauch degrees
by: Cipriani, Vittorio, et al.
Published: (2023)

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
by: Song, Sirun, et al.
Published: (2025)

Introenumerability, autoreducibility, and randomness
by: Li, Ang
Published: (2024)

The singleton degrees of the $Σ^0_2$ sets are not dense
by: Kent, Thomas F., et al.
Published: (2024)

Martin's Conjecture in the Enumeration Degrees
by: Cordero, Antonio Nakid
Published: (2025)

\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees
by: Cintioli, Patrizio
Published: (2026)

A computably enumerable many-one degree with no least finite-one degree
by: Cintioli, Patrizio
Published: (2026)

A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
by: Cintioli, Patrizio
Published: (2026)

A note on the degree structure of primitive recursive m-reducibility
by: Kalmurzayev, Birzhan, et al.
Published: (2023)

Conjunctive reducibilities and completeness
by: Chitaia, Irakli, et al.
Published: (2026)