Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.16477 |
| 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)
by: Rydval, Jakub
Published: (2021)
A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)
by: Buss, Sam, et al.
Published: (2025)
Foundational Analysis Of The Solvability Complexity Index: The Weihrauch-SCI Intermediate Hierarchy
by: Sorg, Christopher
Published: (2026)
by: Sorg, Christopher
Published: (2026)
Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)
by: Brattka, Vasco, et al.
Published: (2024)
A Minimal Substitution Basis for the Kalmár Elementary Functions
by: Prunescu, Mihai, et al.
Published: (2025)
by: Prunescu, Mihai, et al.
Published: (2025)
Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
by: Zhang, Manqing, et al.
Published: (2026)
by: Zhang, Manqing, et al.
Published: (2026)
Refutability as Recursive as Provability
by: Cattabriga, Paola
Published: (2024)
by: Cattabriga, Paola
Published: (2024)
On Chaitin's Heuristic Principle and Halting Probability
by: Salehi, Saeed
Published: (2023)
by: Salehi, Saeed
Published: (2023)
Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)
by: Galatos, Nikolaos, et al.
Published: (2025)
The equational theory of the Weihrauch lattice with multiplication
by: Neumann, Eike, et al.
Published: (2024)
by: Neumann, Eike, et al.
Published: (2024)
Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)
by: Anand, Bhupinder Singh
Published: (2024)
Deciding subspace reachability problems with application to Skolem's Problem
by: Everett, Samuel
Published: (2024)
by: Everett, Samuel
Published: (2024)
A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
by: Fusco, Ludovico, et al.
Published: (2025)
by: Fusco, Ludovico, et al.
Published: (2025)
Anatomy of a Formal Proof
by: Avigad, Jeremy, et al.
Published: (2024)
by: Avigad, Jeremy, et al.
Published: (2024)
Using Aristotle API for AI-Assisted Theorem Proving in Lean 4: A Formalisation Case Study of the Grasshopper Problem
by: Lau, Gabriel Rongyang
Published: (2026)
by: Lau, Gabriel Rongyang
Published: (2026)
There is a deep 1-generic set
by: Li, Ang
Published: (2024)
by: Li, Ang
Published: (2024)
Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
The complexity of being monitorable
by: Camerlo, Riccardo, et al.
Published: (2026)
by: Camerlo, Riccardo, et al.
Published: (2026)
Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)
by: Ferrarotti, Flavio, et al.
Published: (2024)
Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)
by: Tang, Jian-Gang
Published: (2022)
Continuous and algebraic domains in univalent foundations
by: de Jong, Tom, et al.
Published: (2024)
by: de Jong, Tom, et al.
Published: (2024)
Formalising New Mathematics in Isabelle: Diagonal Ramsey
by: Paulson, Lawrence C
Published: (2025)
by: Paulson, Lawrence C
Published: (2025)
Formalizing Pick's Theorem in Isabelle/HOL
by: Binder, Sage, et al.
Published: (2024)
by: Binder, Sage, et al.
Published: (2024)
Variants of Solovay reducibility
by: Titov, Ivan
Published: (2024)
by: Titov, Ivan
Published: (2024)
On Halting vs Converging in Recurrent Graph Neural Networks
by: Bollen, Jeroen, et al.
Published: (2026)
by: Bollen, Jeroen, et al.
Published: (2026)
On the incomputability of computable dimension
by: Staiger, Ludwig
Published: (2019)
by: Staiger, Ludwig
Published: (2019)
Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
by: Kattermann, David, et al.
Published: (2025)
by: Kattermann, David, et al.
Published: (2025)
Finite-Horizon First-Order Rank Profiles of Regular Languages
by: Bazarova, Madina, et al.
Published: (2026)
by: Bazarova, Madina, et al.
Published: (2026)
Nominal techniques as an Agda library
by: Gabbay, Murdoch J., et al.
Published: (2026)
by: Gabbay, Murdoch J., et al.
Published: (2026)
A new decision method for Intuitionistic Logic by 3-valued non-deterministic truth-tables (pre-print version)
by: Leme, Renato, et al.
Published: (2023)
by: Leme, Renato, et al.
Published: (2023)
The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
Languages given by Finite Automata over the Unary Alphabet
by: Czerwiński, Wojciech, et al.
Published: (2023)
by: Czerwiński, Wojciech, et al.
Published: (2023)
Strong Kurtz Randomness and Binary Expansions of Reordered Computable Numbers
by: Hertling, Peter, et al.
Published: (2025)
by: Hertling, Peter, et al.
Published: (2025)
Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)
by: Gheorghiu, Alexander, et al.
Published: (2021)
The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)
by: Kátay, Tamás, et al.
Published: (2023)
Regainingly approximable numbers and sets
by: Hertling, Peter, et al.
Published: (2023)
by: Hertling, Peter, et al.
Published: (2023)
A Higher-Order Vampire (Short Paper)
by: Bhayat, Ahmed, et al.
Published: (2024)
by: Bhayat, Ahmed, et al.
Published: (2024)
The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)
by: Rosko, Milan
Published: (2025)
Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)
by: Pradic, Cécilia, et al.
Published: (2026)
Flexible constraint satisfiability and a problem in semigroup theory
by: Jackson, Marcel
Published: (2015)
by: Jackson, Marcel
Published: (2015)