Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.00058 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Computational Power of Extensional ESO
by: Bodirsky, Manuel, et al.
Published: (2025)
by: Bodirsky, Manuel, et al.
Published: (2025)
Hereditary First-Order Logic: the tractable quantifier prefix classes
by: Bodirsky, Manuel, et al.
Published: (2024)
by: Bodirsky, Manuel, et al.
Published: (2024)
Normal forms in cubical type theory
by: Huang, Xu
Published: (2026)
by: Huang, Xu
Published: (2026)
Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV
by: Nakamura, Yuki
Published: (2026)
by: Nakamura, Yuki
Published: (2026)
Fixed-Point Theorems and the Ethics of Radical Transparency: A Logic-First Treatment
by: Alpay, Faruk, et al.
Published: (2025)
by: Alpay, Faruk, et al.
Published: (2025)
DHoTT: A Temporal Extension of Homotopy Type Theory for Semantic Drift
by: Poernomo, Iman
Published: (2025)
by: Poernomo, Iman
Published: (2025)
ASP Chef grows Mustache to look better
by: Alviano, Mario, et al.
Published: (2025)
by: Alviano, Mario, et al.
Published: (2025)
Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
by: Borzechowski, Manfred, et al.
Published: (2025)
by: Borzechowski, Manfred, et al.
Published: (2025)
Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
by: Hausmann, Daniel, et al.
Published: (2022)
by: Hausmann, Daniel, et al.
Published: (2022)
Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)
by: Greati, Vitor, et al.
Published: (2024)
Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)
by: Balasubramanian, A. R., et al.
Published: (2026)
Complete Game Logic with Sabotage
by: Wafa, Noah Abou El, et al.
Published: (2024)
by: Wafa, Noah Abou El, et al.
Published: (2024)
Inclusion with repetitions and Boolean constants -- implication problems revisited
by: Häggblom, Matilda
Published: (2025)
by: Häggblom, Matilda
Published: (2025)
Axiomatizing approximate inclusion
by: Häggblom, Matilda
Published: (2025)
by: Häggblom, Matilda
Published: (2025)
Axiomatization of approximate exclusion
by: Häggblom, Matilda
Published: (2024)
by: Häggblom, Matilda
Published: (2024)
What If Turing Had Preceded Gödel?
by: Oberhoff, Sebastian
Published: (2024)
by: Oberhoff, Sebastian
Published: (2024)
Behavioural Conformances based on Lax Couplings
by: Wild, Paul, et al.
Published: (2025)
by: Wild, Paul, et al.
Published: (2025)
Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
by: Gylterud, Håkon Robbestad, et al.
Published: (2020)
by: Gylterud, Håkon Robbestad, et al.
Published: (2020)
A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)
by: Chen, Lijie, et al.
Published: (2026)
Towards Weak Stratification for Logics of Definitions
by: Guermond, Nathan
Published: (2026)
by: Guermond, Nathan
Published: (2026)
Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)
by: Pradic, Cécilia, et al.
Published: (2025)
First-Order Coalition Logic
by: Catta, Davide, et al.
Published: (2025)
by: Catta, Davide, et al.
Published: (2025)
Ordinal Folding Index: A Computable Metric for Self-Referential Semantics
by: Alpay, Faruk, et al.
Published: (2025)
by: Alpay, Faruk, et al.
Published: (2025)
Implicit Knowledge in Unawareness Structures
by: Belardinelli, Gaia, et al.
Published: (2023)
by: Belardinelli, Gaia, et al.
Published: (2023)
The Golden Path to Guarded Monotone Strict NP
by: Barsukov, Alexey, et al.
Published: (2023)
by: Barsukov, Alexey, et al.
Published: (2023)
Betting on what is neither verifiable nor falsifiable
by: Sudhir, Abhimanyu Pallavi, et al.
Published: (2024)
by: Sudhir, Abhimanyu Pallavi, et al.
Published: (2024)
Thoughts on sub-Turing interactive computability
by: Japaridze, Giorgi
Published: (2024)
by: Japaridze, Giorgi
Published: (2024)
Node Replication: Theory And Practice
by: Kesner, Delia, et al.
Published: (2022)
by: Kesner, Delia, et al.
Published: (2022)
Extracting total Amb programs from proofs
by: Berger, Ulrich, et al.
Published: (2023)
by: Berger, Ulrich, et al.
Published: (2023)
On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)
by: Krajicek, Jan
Published: (2022)
Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
by: Lopez, Aliaume
Published: (2024)
by: Lopez, Aliaume
Published: (2024)
Formal Verification of Diffusion Auctions
by: Galimullin, Rustam, et al.
Published: (2025)
by: Galimullin, Rustam, et al.
Published: (2025)
A Logic For Fresh Labelled Transition Systems
by: Bandukara, Mohamed H, et al.
Published: (2025)
by: Bandukara, Mohamed H, et al.
Published: (2025)
Knowability as continuity: a topological account of informational dependence
by: Baltag, Alexandru, et al.
Published: (2024)
by: Baltag, Alexandru, et al.
Published: (2024)
New Bounds for the Ideal Proof System in Positive Characteristic
by: Behera, Amik Raj, et al.
Published: (2025)
by: Behera, Amik Raj, et al.
Published: (2025)
Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2025)
Set Theory in the Foundation of Math; Internal Classes and External Sets
by: Levin, Leonid A.
Published: (2022)
by: Levin, Leonid A.
Published: (2022)
A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)
by: Latkin, Ivan V.
Published: (2023)
On the Complexity and Properties of Preferential Propositional Dependence Logic
by: Sauerwald, Kai, et al.
Published: (2025)
by: Sauerwald, Kai, et al.
Published: (2025)
Representation Theorems for Cumulative Propositional Dependence Logics
by: Kontinen, Juha, et al.
Published: (2026)
by: Kontinen, Juha, et al.
Published: (2026)