Cover Image

A jump operator on the Weihrauch degrees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Andrews, Uri, Lempp, Steffen, Marcone, Alberto, Miller, Joseph S., Valenti, Manlio
Format:	Preprint
Published:	2024
Subjects:	Logic 03D30, 03D78
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)

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

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

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

The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)

Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
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)

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

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

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

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

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

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

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023)

Analogues of the countable Borel equivalence relations in the setting of computable reducibility
by: Andrews, Uri, et al.
Published: (2024)

New definitions in the theory of Type 1 computable topological spaces
by: Rauzy, Emmanuel
Published: (2023)

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

Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)

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

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

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

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

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

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

Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)

Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)

Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)

Evaluative presentations
by: McNicholl, Timothy H.
Published: (2024)

Computable Bases
by: Brattka, Vasco, et al.
Published: (2025)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
by: Samra, Jean Abou, et al.
Published: (2026)

A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)

Computable topological groups
by: Koh, Heer Tern, et al.
Published: (2022)

Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras
by: Eagle, Christopher, et al.
Published: (2025)

Finite final segments of the d.c.e. Turing degrees
by: Lempp, Steffen, et al.
Published: (2024)

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

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

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

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

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