Cover Image

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tabatabai, Amirhossein Akbar, Greati, Vitor, Ramanayake, Revantha
Format:	Preprint
Published:	2025
Subjects:	Logic Computational Complexity Logic in Computer Science 03D15, 03D20, 03D60, 03F15 F.1.3; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

The Aurellion Function: A Recursive Fast-Growing Hierarchy Beyond Knuth Notation
by: Vodrazka, Daniel
Published: (2025)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

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

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

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

Semi-Algebraic Proof Systems for QBF
by: Beyersdorff, Olaf, et al.
Published: (2025)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

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

Effective bases and notions of effective second countability in computable analysis
by: Brattka, Vasco, et al.
Published: (2025)

The logic of bunched implications is undecidable
by: Galatos, Nick, et al.
Published: (2026)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

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)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

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

Punctually Standard and Nonstandard Models of Natural Numbers
by: Bazhenov, Nikolay, et al.
Published: (2026)

The Golden Path to Guarded Monotone Strict NP
by: Barsukov, Alexey, et al.
Published: (2023)

On Some Complexity Results for Even Linear Languages
by: Cojocaru, Liliana
Published: (2024)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

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

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Consistent ultrafinitist logic
by: Gajda, Michał J.
Published: (2021)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)

Sheaves as oracle computations
by: Ahman, Danel, et al.
Published: (2026)

Loops, Inverse Limits and Non-Determinism
by: Brattka, Vasco
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)

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

Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2025)

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

Robinson Splitting Theorem and $Σ_1$ Induction
by: Liu, Yong, et al.
Published: (2026)

Automatic structures and the problem of natural well-orderings
by: Beklemishev, Lev D., et al.
Published: (2024)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

On the computational properties of basic mathematical notions
by: Normann, Dag, et al.
Published: (2022)

Algorithmic aspects of left-orderings of solvable Baumslag--Solitar groups via its dynamical realization
by: Ho, Meng-Che "Turbo", et al.
Published: (2024)