Proof equivalence in MLL is PSPACE-complete
From MaRDI portal
Recommendations
- No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
- MALL proof equivalence is logspace-complete, via binary decision diagrams
- Completeness of MLL proof-nets w.r.t. weak distributivity
- Equivalence in finite-variable logics is complete for polynomial time
- Towards a pseudoequational proof theory
- Completeness of Proof Systems for Equational Specifications
- Presburger Modal Logic Is PSPACE-Complete
- Proof lengths for equational completion
- scientific article; zbMATH DE number 3952747
Cited in
(14)- PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points
- Completeness of MLL proof-nets w.r.t. weak distributivity
- Multiplicative-additive proof equivalence is \textsf{logspace}-complete, via binary decision trees
- scientific article; zbMATH DE number 7003195 (Why is no real title available?)
- No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
- scientific article; zbMATH DE number 7359406 (Why is no real title available?)
- scientific article; zbMATH DE number 7471682 (Why is no real title available?)
- Homomorphism reconfiguration via homotopy
- MALL proof equivalence is logspace-complete, via binary decision diagrams
- Fixed-parameter algorithms for graph constraint logic
- Fixed-parameter algorithms for graph constraint logic
- Combinatorial flows as bicolored atomic flows
- Type isomorphisms for multiplicative-additive linear logic
- Lambek calculus with banged atoms for parasitic gaps
This page was built for publication: Proof equivalence in MLL is PSPACE-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790165)
