Cover Image

A Minimal Substitution Basis for the Kalmár Elementary Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Prunescu, Mihai, Sauras-Altuzarra, Lorenzo, Shunia, Joseph M.
Format:	Preprint
Published:	2025
Subjects:	Logic Computational Complexity Logic in Computer Science 03D20 (Primary), 03D55, 03B70, 68Q15 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finitely Bounded Homogeneity Turned Inside-Out
by: Rydval, Jakub
Published: (2021)

Refutability as Recursive as Provability
by: Cattabriga, Paola
Published: (2024)

Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)

Solovay reducibility implies S2a-reducibility
by: Titov, Ivan
Published: (2024)

A total Solovay reducibility and totalizing of the notion of speedability
by: Merkle, Wolfgang, et al.
Published: (2024)

An equiconsistency proof for $\mathrm{CZF} + V = L$
by: Wang, Shuwei
Published: (2026)

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
by: Kattermann, David, et al.
Published: (2025)

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

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

Definability over $\mathrm BΣ^0_2$-models
by: Chong, Chi Tat, et al.
Published: (2025)

The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)

Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)

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

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

Very large set axioms over constructive set theories
by: Jeon, Hanul, et al.
Published: (2022)

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

A proof of P!=NP
by: McCallum, Rupert
Published: (2020)

Completeness and Well-Definability of a Provability Degree Measure in Sufficiently Powerful Formal Systems, and Finite-Time Effective Knowers
by: Bahl, Rohan
Published: (2024)

Clarifying ordinals
by: Schweber, Noah
Published: (2024)

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

Extending the Limit Theorem of Barmpalias and Lewis-Pye to all reals
by: Titov, Ivan
Published: (2024)

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

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

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

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

From Gödel incompleteness to the consistency of circuit lower bounds
by: Atserias, Albert, et al.
Published: (2026)

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

Deciding winning strategies in Yu-Gi-Oh! TCG is hard
by: Nicolosi, Orazio, et al.
Published: (2026)

Antichain of ordinals in intuitionistic set theory
by: Wang, Shuwei
Published: (2025)

Some notes on plump ordinals
by: Wang, Shuwei
Published: (2026)

The Weihrauch lattice at the level of $\boldsymbolΠ_1^1\mathsf{-CA}_0$: the Cantor-Bendixson theorem
by: Cipriani, Vittorio, et al.
Published: (2022)

Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)

On the first-order theory of the remainder
by: Prunescu, Mihai
Published: (2025)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)

Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)

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

The calculus of names -- The legacy of Jan Łukasiewicz
by: Pietruszczak, Andrzej
Published: (2023)