Martin's Conjecture in the Enumeration Degrees
Fuente:
arXiv
Saved in:
| Main Author: | Cordero, Antonio Nakid |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Comparing the Effective Content of Subshifts
by: Cordero, Antonio Nakid, et al.
Published: (2026)
by: Cordero, Antonio Nakid, et al.
Published: (2026)
A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
by: Cintioli, Patrizio
Published: (2026)
by: Cintioli, Patrizio
Published: (2026)
A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023)
by: Gerdes, Peter
Published: (2023)
On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
by: Song, Sirun, et al.
Published: (2025)
by: Song, Sirun, et al.
Published: (2025)
Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2025)
by: Liu, Yong, et al.
Published: (2025)
$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
by: Cintioli, Patrizio
Published: (2026)
by: Cintioli, Patrizio
Published: (2026)
Isolated d.c.e. degrees and $Σ_1$ induction
by: Liu, Yiqun, et al.
Published: (2025)
by: Liu, Yiqun, et al.
Published: (2025)
There is No Composition in the Computable Reducibility Degrees
by: Mourad, Daniel
Published: (2024)
by: Mourad, Daniel
Published: (2024)
Kolmogorov Complexity of Attractive Degrees
by: Royer, Tiago
Published: (2025)
by: Royer, Tiago
Published: (2025)
Isomorphism Spectra and Computably Composite Structures
by: Lakerdas-Gayle, Joey
Published: (2025)
by: Lakerdas-Gayle, Joey
Published: (2025)
The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
by: Harrington, Leo A., et al.
Published: (2025)
by: Harrington, Leo A., et al.
Published: (2025)
\texorpdfstring{$D$}{D}-maximal many-one degrees contain least finite-one degrees
by: Cintioli, Patrizio
Published: (2026)
by: Cintioli, Patrizio
Published: (2026)
A computably enumerable many-one degree with no least finite-one degree
by: Cintioli, Patrizio
Published: (2026)
by: Cintioli, Patrizio
Published: (2026)
Introenumerability, autoreducibility, and randomness
by: Li, Ang
Published: (2024)
by: Li, Ang
Published: (2024)
A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)
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)
by: Kalmurzayev, Birzhan, et al.
Published: (2023)
Conjunctive reducibilities and completeness
by: Chitaia, Irakli, et al.
Published: (2026)
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)
by: Kent, Thomas F., et al.
Published: (2024)
Finite final segments of the d.c.e. Turing degrees
by: Lempp, Steffen, et al.
Published: (2024)
by: Lempp, Steffen, et al.
Published: (2024)
Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)
by: Hertling, Peter, et al.
Published: (2023)
Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)
by: Lempp, Steffen, et al.
Published: (2023)
The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
The Galvin-Prikry Theorem in the Weihrauch lattice
by: Marcone, Alberto, et al.
Published: (2024)
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)
by: Cipriani, Vittorio, et al.
Published: (2022)
Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)
by: Pradic, Cécilia, et al.
Published: (2026)
Contrasting the Halves of an Ahmad Pair
by: Ravishankar, Karthik
Published: (2025)
by: Ravishankar, Karthik
Published: (2025)
Chains and antichains in the Weihrauch lattice
by: Lempp, Steffen, et al.
Published: (2024)
by: Lempp, Steffen, et al.
Published: (2024)
On Sets That Encode Themselves
by: Em, Taeyoung
Published: (2026)
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)
by: Cole, Joshua
Published: (2024)
A $wtt$-introimmune set in \texorpdfstring{$Π^0_1$}{Pi01} and introimmunity for several reducibilities
by: Cintioli, Patrizio
Published: (2026)
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)
by: Samra, Jean Abou, et al.
Published: (2026)
Open Problems in Computability Theory and Descriptive Set Theory
by: Barmpalias, George, et al.
Published: (2025)
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)
by: Andrews, Uri, et al.
Published: (2024)
Part 1 of Martin's Conjecture for order-preserving and measure-preserving functions
by: Lutz, Patrick, et al.
Published: (2023)
by: Lutz, Patrick, et al.
Published: (2023)
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)
by: Hertling, Peter, et al.
Published: (2025)
Bounded Ramsey's theorem for triples in computability theory
by: Patey, Ludovic, et al.
Published: (2026)
by: Patey, Ludovic, et al.
Published: (2026)
Solovay reducibility implies S2a-reducibility
by: Titov, Ivan
Published: (2024)
by: Titov, Ivan
Published: (2024)
A total Solovay reducibility and totalizing of the notion of speedability
by: Merkle, Wolfgang, et al.
Published: (2024)
by: Merkle, Wolfgang, et al.
Published: (2024)
The reverse mathematics of bounded Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2025)
by: Houérou, Quentin Le, et al.
Published: (2025)
Countable Ordered Groups and Weihrauch Reducibility
by: Li, Ang
Published: (2024)
by: Li, Ang
Published: (2024)
Similar Items
-
Comparing the Effective Content of Subshifts
by: Cordero, Antonio Nakid, et al.
Published: (2026) -
A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
by: Cintioli, Patrizio
Published: (2026) -
A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023) -
On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
by: Song, Sirun, et al.
Published: (2025) -
Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2025)