Cover Image

Turing Degrees of Hyperjumps

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jananthan, Hayden R., Simpson, Stephen G.
Format:	Preprint
Published:	2021
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The subTuring degrees
by: Kihara, Takayuki, et al.
Published: (2024)

Incompleteness theorems via Turing category
by: Savelyev, Yasha
Published: (2024)

Did Turing prove the undecidability of the halting problem?
by: Hamkins, Joel David, et al.
Published: (2024)

Effectivity and Reducibility with Ordinal Turing Machines
by: Carl, Merlin
Published: (2018)

A Note on Clockability for Ordinal Turing Machines
by: Carl, Merlin
Published: (2019)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

Equivalence and Conditional Independence in Atomic Sheaf Logic
by: Simpson, Alex
Published: (2024)

Degrees of incomputability, realizability and constructive reverse mathematics
by: Kihara, Takayuki
Published: (2020)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
by: Carl, Merlin
Published: (2024)

Toward higher-order infinite time Turing machines: simulational $Γ$-machines
by: Bournez, Olivier, et al.
Published: (2025)

Fagin's Theorem for Semiring Turing Machines
by: Badia, Guillermo, et al.
Published: (2025)

Big Ramsey Degrees in Ultraproducts of Finite Structures
by: Bartošová, Dana, et al.
Published: (2022)

Degrees of the finite model property: the antidichotomy theorem
by: Bezhanishvili, Guram, et al.
Published: (2023)

Semantics for a Turing-complete Reversible Programming Language with Inductive Types
by: Chardonnet, Kostia, et al.
Published: (2023)

Randomness and Degree Theory for Infinite Time Register Machines
by: Carl, Merlin
Published: (2015)

Degree spectra of homeomorphism types of compact Polish spaces
by: Hoyrup, Mathieu, et al.
Published: (2020)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
by: Blanc, Manon, et al.
Published: (2023)

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

A Relation on ${(ω, <)}$ of Intermediate Degree Spectrum on a Cone
by: Damaj, Jad, et al.
Published: (2024)

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

Expressivity of AuDaLa: Turing Completeness and Possible Extensions
by: Franken, Tom T. P., et al.
Published: (2024)

Local-Order-Invariant Logic on Classes of Bounded Degree
by: Aoki, Derek
Published: (2025)

Diagonalizing Through the $ω$-Chain: Iterated Self-Certification on Bounded Turing Machines and its Least Fixed Point
by: Sung, Miara
Published: (2026)

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

Stochastic Process Turing Machines
by: Wolpert, David, et al.
Published: (2024)

Softmax Transformers are Turing-Complete
by: Jiang, Hongjian, et al.
Published: (2025)

Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
by: Coniglio, M. E., et al.
Published: (2026)

An Imperative Language for Verified Exact Real-Number Computation
by: Bauer, Andrej, et al.
Published: (2024)

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
by: Lohrey, Markus, et al.
Published: (2025)

A note reviewing Turing's 1936
by: Cattabriga, Paola
Published: (2013)

Probabilistic Strategy Logic with Degrees of Observability
by: Mu, Chunyan, et al.
Published: (2024)

What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
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)

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

Tableau methodology for propositional logics
by: Jarmuzek, T., et al.
Published: (2025)

A note on Stone-Čech compactification in ZFA
by: Przybyłek, Michał R.
Published: (2023)

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

Degree of Kripke-incompleteness of Tense Logics
by: Chen, Qian
Published: (2025)