:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Li, Ang
Format:	Preprint
Published:	2024
Subjects:	Logic 03D30, 03D32
Online Access:	https://arxiv.org/abs/2402.08247
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
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)

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

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)

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

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

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

Information vs Dimension -- an Algorithmic Perspective
by: Reimann, Jan
Published: (2024)

Extending the Limit Theorem of Barmpalias and Lewis-Pye to all reals
by: Titov, Ivan
Published: (2024)

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

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

A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
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)

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

On the incomputability of computable dimension
by: Staiger, Ludwig
Published: (2019)

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

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

Computability in infinite Galois theory and algorithmically random algebraic fields
by: Calvert, Wesley, et al.
Published: (2023)

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

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

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

The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, 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)

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

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

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

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
by: Harrington, Leo A., et al.
Published: (2025)

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

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

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

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

Kolmogorov Complexity of Attractive Degrees
by: Royer, Tiago
Published: (2025)