:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Royer, Tiago
Format:	Preprint
Published:	2025
Subjects:	Logic 03D30
Online Access:	https://arxiv.org/abs/2505.02726
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
by: Cintioli, Patrizio
Published: (2026)

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

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

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023)

Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2025)

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

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

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

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

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

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)

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

Dense Chains, Antichains, and Universal Partial Orders Inside a Bounded Finite-One Degree
by: Cintioli, Patrizio
Published: (2026)

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

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

On Sets That Encode Themselves
by: Em, Taeyoung
Published: (2026)

A closed subset of Baire space not Medvedev equivalent to any closed set of Cantor space
by: Cole, Joshua
Published: (2024)

A $wtt$-introimmune set in \texorpdfstring{$Π^0_1$}{Pi01} and introimmunity for several reducibilities
by: Cintioli, Patrizio
Published: (2026)

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

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

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

Open Problems in Computability Theory and Descriptive Set Theory
by: Barmpalias, George, et al.
Published: (2025)

Analogues of the countable Borel equivalence relations in the setting of computable reducibility
by: Andrews, Uri, 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)

Contrasting the Halves of an Ahmad Pair
by: Ravishankar, Karthik
Published: (2025)

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

There is a deep 1-generic set
by: Li, Ang
Published: (2024)

Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)

Solovay reducibility implies S2a-reducibility
by: Titov, Ivan
Published: (2024)

A total Solovay reducibility and totalizing of the notion of speedability
by: Merkle, Wolfgang, et al.
Published: (2024)

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

Comparing Notions of Dense Computability on $ω^ω$ and $2^ω$
by: Gerdes, Peter M.
Published: (2025)

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

$Π^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)

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

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