Cover Image

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Song, Sirun, Yu, Liang
Format:	Preprint
Published:	2025
Subjects:	Logic 03D28, 03D30, 03D32
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

Isolated d.c.e. degrees and $Σ_1$ induction
by: Liu, Yiqun, et al.
Published: (2025)

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

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

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

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)

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

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

Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, 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)

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

Isomorphism Spectra and Computably Composite Structures
by: Lakerdas-Gayle, Joey
Published: (2025)

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

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

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

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

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

Variants of the chain-antichain principle in reverse mathematics
by: Hughes, Noah A.
Published: (2025)

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

A non-speedup result for the chain-antichain principle over a weak base theory
by: Kowalik, Katarzyna W.
Published: (2025)

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

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

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

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

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

The tree pigeonhole principle in the Weihrauch degrees
by: Dzhafarov, Damir, 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)

Comparing the Effective Content of Subshifts
by: Cordero, Antonio Nakid, et al.
Published: (2026)

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

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

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

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