Undecidability of theories of semirings with fixed points
Fuente:
arXiv
Saved in:
| Main Authors: | Das, Anupam, De, Abhishek, Kuznetsov, Stepan L. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)
by: Das, Anupam, et al.
Published: (2026)
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Computational expressivity of (circular) proofs with fixed points
by: Curzi, Gianluca, et al.
Published: (2023)
by: Curzi, Gianluca, et al.
Published: (2023)
The proof theory and semantics of second-order (intuitionistic) tense logic
by: Becker, Justus, et al.
Published: (2026)
by: Becker, Justus, et al.
Published: (2026)
Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)
by: Curzi, Gianluca, et al.
Published: (2021)
Relational Models for the Lambek Calculus with Intersection and Constants
by: Kuznetsov, Stepan L.
Published: (2022)
by: Kuznetsov, Stepan L.
Published: (2022)
An abstract fixed-point theorem for Horn formula equations
by: Hetzl, Stefan, et al.
Published: (2025)
by: Hetzl, Stefan, et al.
Published: (2025)
Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)
by: Das, Anupam, et al.
Published: (2021)
On syntactic concept lattice models for the Lambek calculus and infinitary action logic
by: Kuznetsov, Stepan L.
Published: (2025)
by: Kuznetsov, Stepan L.
Published: (2025)
The Undecidability of Quantified Announcements
by: Ågotnes, Thomas, et al.
Published: (2024)
by: Ågotnes, Thomas, et al.
Published: (2024)
Undecidability of Linear Logics without Weakening
by: Suzuki, Jun, et al.
Published: (2025)
by: Suzuki, Jun, et al.
Published: (2025)
Nonlinear Arithmetic with SMTLIB Division is Undecidable
by: Jovanovic, Dejan
Published: (2026)
by: Jovanovic, Dejan
Published: (2026)
Enumerating Independent Linear Inferences
by: Das, Anupam, et al.
Published: (2021)
by: Das, Anupam, et al.
Published: (2021)
Systemic Constraints of Undecidability
by: Bulin, Seth
Published: (2025)
by: Bulin, Seth
Published: (2025)
Conjunctive categorial grammars and Lambek grammars with additives
by: Kuznetsov, Stepan L., et al.
Published: (2024)
by: Kuznetsov, Stepan L., et al.
Published: (2024)
Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
by: Dudenhefner, Andrej
Published: (2026)
by: Dudenhefner, Andrej
Published: (2026)
Subvarieties of pointed Abelian l-groups
by: Jankovec, Filip
Published: (2025)
by: Jankovec, Filip
Published: (2025)
The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
by: Chodil, Miroslav, et al.
Published: (2025)
by: Chodil, Miroslav, et al.
Published: (2025)
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
by: Fortin, Marie, et al.
Published: (2023)
by: Fortin, Marie, et al.
Published: (2023)
Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)
by: Toledo, Guilherme V., et al.
Published: (2026)
Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)
by: Köpp, Nils, et al.
Published: (2022)
On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)
by: Beckmann, Arnold, et al.
Published: (2022)
Being polite is not enough (and other limits of theory combination)
by: Toledo, Guilherme V., et al.
Published: (2025)
by: Toledo, Guilherme V., et al.
Published: (2025)
A uniform cut-elimination theorem for linear logics with fixed points and super exponentials
by: Bauer, Esaïe, et al.
Published: (2025)
by: Bauer, Esaïe, et al.
Published: (2025)
Domain theory in univalent foundations I: Directed complete posets and Scott's $D_\infty$
by: de Jong, Tom
Published: (2024)
by: de Jong, Tom
Published: (2024)
Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops
by: Nakamura, Yoshiki
Published: (2025)
by: Nakamura, Yoshiki
Published: (2025)
Rings and Boolean Algebras as Algebraic Theories
by: De Faveri, Arturo
Published: (2025)
by: De Faveri, Arturo
Published: (2025)
Relative fixed points of functors
by: Schoen, Ezra, et al.
Published: (2023)
by: Schoen, Ezra, et al.
Published: (2023)
An Undecidability Proof for the Plan Existence Problem
by: Achilleos, Antonis
Published: (2026)
by: Achilleos, Antonis
Published: (2026)
On Formally Undecidable Traits of Intelligent Machines
by: Fox, Matthew
Published: (2024)
by: Fox, Matthew
Published: (2024)
On the complexity of normalization for the planar $λ$-calculus
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
The Leibniz adjunction in homotopy type theory, with an application to simplicial type theory
by: de Jong, Tom, et al.
Published: (2026)
by: de Jong, Tom, et al.
Published: (2026)
Refutation calculi for lattice-based logics: from display to tableaux
by: De Domenico, Andrea, et al.
Published: (2026)
by: De Domenico, Andrea, et al.
Published: (2026)
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
by: Kobayashi, Naoki
Published: (2024)
by: Kobayashi, Naoki
Published: (2024)
Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
by: De Domenico, Andrea, et al.
Published: (2024)
by: De Domenico, Andrea, et al.
Published: (2024)
Homotopy type theory as a language for diagrams of $\infty$-logoses
by: Uemura, Taichi
Published: (2022)
by: Uemura, Taichi
Published: (2022)
Formalizing two-level type theory with cofibrant exo-nat
by: Uskuplu, Elif
Published: (2023)
by: Uskuplu, Elif
Published: (2023)
Similar Items
-
Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026) -
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024) -
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025) -
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025) -
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)