Lattice initial segments of the hyperdegrees
Fuente:
arXiv
Saved in:
| Main Authors: | Shore, Richard A., Kjos-Hanssen, Bjørn |
|---|---|
| Format: | Preprint |
| Published: |
2014
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Classification and deontic explosion for contrary-to-duty obligations
by: Kjos-Hanssen, Bjørn
Published: (2026)
by: Kjos-Hanssen, Bjørn
Published: (2026)
Finite final segments of the d.c.e. Turing degrees
by: Lempp, Steffen, et al.
Published: (2024)
by: Lempp, Steffen, et al.
Published: (2024)
Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)
by: Chen, Joey, et al.
Published: (2025)
Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023)
by: Lempp, Steffen, et al.
Published: (2023)
The initial segment condition for $κ^+$-supercompactness
by: Schlutzenberg, Farmer
Published: (2023)
by: Schlutzenberg, Farmer
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)
Martin's Conjecture in the Enumeration Degrees
by: Cordero, Antonio Nakid
Published: (2025)
by: Cordero, Antonio Nakid
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)
Listing the hyperarithmetical functions
by: Miller, Joseph S., et al.
Published: (2026)
by: Miller, Joseph S., et al.
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)
New definitions in the theory of Type 1 computable topological spaces
by: Rauzy, Emmanuel
Published: (2023)
by: Rauzy, Emmanuel
Published: (2023)
A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023)
by: Rauzy, Emmanuel
Published: (2023)
A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
by: Cintioli, Patrizio
Published: (2026)
by: Cintioli, Patrizio
Published: (2026)
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)
$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees
by: Cintioli, Patrizio
Published: (2026)
by: Cintioli, Patrizio
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)
Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)
by: Rydval, Jakub
Published: (2021)
Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)
by: Pradic, Cécilia, et al.
Published: (2026)
Variants of the chain-antichain principle in reverse mathematics
by: Hughes, Noah A.
Published: (2025)
by: Hughes, Noah A.
Published: (2025)
Effective weak convergence and tightness of measures in computable Polish spaces
by: Rojas, Diego A.
Published: (2024)
by: Rojas, Diego A.
Published: (2024)
Benign approximations and non-speedability
by: Hölzl, Rupert, et al.
Published: (2023)
by: Hölzl, Rupert, et al.
Published: (2023)
Randomness versus superspeedability
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
Isomorphism Spectra and Computably Composite Structures
by: Lakerdas-Gayle, Joey
Published: (2025)
by: Lakerdas-Gayle, Joey
Published: (2025)
The computational content of multidimensional discontinuity
by: Hölzl, Rupert, et al.
Published: (2024)
by: Hölzl, Rupert, et al.
Published: (2024)
On the computability of cofinal Fraïssé limits
by: Ackerman, Nathanael, et al.
Published: (2026)
by: Ackerman, Nathanael, et al.
Published: (2026)
On the computational properties of basic mathematical notions
by: Normann, Dag, et al.
Published: (2022)
by: Normann, Dag, et al.
Published: (2022)
A $Π^0_2$ Singleton of Minimal Arithmetic Degree
by: Gerdes, Peter
Published: (2023)
by: Gerdes, Peter
Published: (2023)
Iterated Priority Arguments in Descriptive Set Theory
by: Day, Adam, et al.
Published: (2022)
by: Day, Adam, et al.
Published: (2022)
On the first-order theory of the remainder
by: Prunescu, Mihai
Published: (2025)
by: Prunescu, Mihai
Published: (2025)
Computable Bases
by: Brattka, Vasco, et al.
Published: (2025)
by: Brattka, Vasco, et al.
Published: (2025)
Low$_2$ computably enumerable sets have hyperhypersimple supersets
by: Cholak, Peter, et al.
Published: (2024)
by: Cholak, Peter, et al.
Published: (2024)
On Sets That Encode Themselves
by: Em, Taeyoung
Published: (2026)
by: Em, Taeyoung
Published: (2026)
Kolmogorov Complexity of Attractive Degrees
by: Royer, Tiago
Published: (2025)
by: Royer, Tiago
Published: (2025)
Evaluative presentations
by: McNicholl, Timothy H.
Published: (2024)
by: McNicholl, Timothy H.
Published: (2024)
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 Counterexample Regarding C.E. Closed Subsets of [0,1] Under Homeomorphisms
by: Bosserhoff, Volker
Published: (2025)
by: Bosserhoff, Volker
Published: (2025)
Computable categoricity relative to a c.e. degree
by: Villano, Java Darleen
Published: (2024)
by: Villano, Java Darleen
Published: (2024)
Similar Items
-
Classification and deontic explosion for contrary-to-duty obligations
by: Kjos-Hanssen, Bjørn
Published: (2026) -
Finite final segments of the d.c.e. Turing degrees
by: Lempp, Steffen, et al.
Published: (2024) -
Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025) -
Minimal covers in the Weihrauch degrees
by: Lempp, Steffen, et al.
Published: (2023) -
The initial segment condition for $κ^+$-supercompactness
by: Schlutzenberg, Farmer
Published: (2023)