Similar Items: Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees
- Proof equivalence in MLL is PSPACE-complete
- Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs
- The Completeness of Propositional Resolution: A Simple and Constructive Proof
- Minimisation of Multiplicity Tree Automata
- Type Isomorphisms for Multiplicative-Additive Linear Logic
- Maximum Matching and Related Problems in Catalytic Logspace