Similar Items: Proof equivalence in MLL is PSPACE-complete
- The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
- Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees
- Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs
- The Completeness of Propositional Resolution: A Simple and Constructive Proof
- Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
- Behavioural equivalences for timed systems