Proof equivalence in MLL is PSPACE-complete

@article{Heijltjes2016ProofEI,
  title={Proof equivalence in MLL is PSPACE-complete},
  author={W. Heijltjes and Robin Houston},
  journal={Log. Methods Comput. Sci.},
  year={2016},
  volume={12}
}
MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for star-autonomous categories. Previous work has shown the problem to be equivalent to a rewiring problem on proof nets, which are not canonical for full MLL due to the presence of the two units. Drawing from recent work on reconfiguration problems, in this paper it is shown that MLL proof equivalence is… Expand
Proof Nets for Bi-Intuitionistic Linear Logic
Fixed-Parameter Algorithms for Graph Constraint Logic
Taylor expansion in linear logic is invertible
  • D. Carvalho
  • Computer Science, Mathematics
  • Log. Methods Comput. Sci.
  • 2018
Multiple conclusion linear logic: cut elimination and more

References

SHOWING 1-10 OF 40 REFERENCES
Constant-Only Multiplicative Linear Logic is NP-Complete
Proof Nets for Additive Linear Logic with Units
  • W. Heijltjes
  • Computer Science, Mathematics
  • 2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
From Proof Nets to the Free *-Autonomous Category
Decision Problems for Propositional Linear Logic
On Proof Nets for Multiplicative Linear Logic with Units
Canonical Sequent Proofs via Multi-Focusing
Horn programming in linear logic is NP-complete
  • M. Kanovich
  • Mathematics, Computer Science
  • [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
  • 1992
...
1
2
3
4
...