Cover Image

Listing the hyperarithmetical functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Miller, Joseph S., Osso, Gian Marco, Scott, Isabella
Format:	Preprint
Published:	2026
Subjects:	Logic 03D60, 03D80
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Forcing and classes of $\mathsf{HYP}$-dominating functions
by: Greenberg, Noam, et al.
Published: (2026)

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

Computable Approximations of Semicomputable Graphs
by: Čačić, Vedran, et al.
Published: (2024)

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

Part 1 of Martin's Conjecture for order-preserving and measure-preserving functions
by: Lutz, Patrick, et al.
Published: (2023)

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

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

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

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

Bounded Ramsey's theorem for triples in computability theory
by: Patey, Ludovic, et al.
Published: (2026)

Hallucination, abstention, and computable inseparability
by: Imamura, Takuma
Published: (2026)

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

Fundamental sequences based on localization
by: Wilken, Gunnar
Published: (2024)

Generalizing Goodstein's theorem and Cichon's independence proof
by: Wilken, Gunnar
Published: (2025)

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

Strong reducibilities and set theory
by: Schweber, Noah
Published: (2024)

Iterated jump noncomputability and compactness
by: Dooley, Gavin
Published: (2025)

More conservativity for weak Kőnig's lemma
by: Freund, Anton, et al.
Published: (2024)

A jump operator on the Weihrauch degrees
by: Andrews, Uri, et al.
Published: (2024)

Analysis of HOD for Admissible Structures
by: Kruschewski, Jan, et al.
Published: (2025)

The reverse mathematics of bounded Ramsey's theorem for pairs
by: Houérou, Quentin Le, et al.
Published: (2025)

Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024)

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

The reverse mathematics of the pigeonhole hierarchy
by: Houérou, Quentin Le, et al.
Published: (2024)

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
by: Rauzy, Emmanuel
Published: (2023)

On a Conjecture Regarding the Mouse Order for Weasels
by: Kruschewski, Jan, et al.
Published: (2022)

Proof-theoretic dilator and intermediate pointclasses
by: Jeon, Hanul
Published: (2025)

Induction on Dilators and Bachmann-Howard Fixed Points
by: Aguilera, Juan P., et al.
Published: (2024)

Regressive versions of Hindman's Theorem
by: Carlucci, Lorenzo, et al.
Published: (2022)

Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
by: Huttegger, Simon M., et al.
Published: (2024)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)

Recursive Analogues of Shrewdness and Subtlety, with Applications to Fine Structure
by: Massmann, Jayde Sylvie
Published: (2023)

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

Implications in pseudocomplemented and Stone lattices
by: Chajda, Ivan, et al.
Published: (2024)

Exploring the abyss in Kleene's computability theory
by: Sanders, Sam
Published: (2023)

Extending orders to types
by: Baglini, Lorenzo Luperi, et al.
Published: (2025)

Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
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)