Proof equivalence in MLL is PSPACE-complete

  title={Proof equivalence in MLL is PSPACE-complete},
  author={Willem Heijltjes and Robin Houston},
  journal={Log. Methods Comput. Sci.},
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
An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets
It is shown that, provided the authors impose a constraint on some paths, they can bound the size of all the nets satisfying this constraint and reducing to a fixed resultant net, which gives a sufficient condition for an infinite weighted sum of nets to reduce into another sum ofnets, while keeping coefficients finite. Expand
Proof Nets for Bi-Intuitionistic Linear Logic
This work gives proof nets for the multiplicative, unit-free fragment MBILL-. Expand
Fixed-Parameter Algorithms for Graph Constraint Logic
It is shown that NCL is fixed-parameter tractable (FPT) for any of these parameters, and that, in a sense, NCL as introduced by Hearn and Demaine is defined in the most economical way for the purpose of capturing \PSPACE. Expand
Multiple conclusion linear logic: cut elimination and more
Full intuitionistic linear logic (FILL) was first introduced by Hyland and de Paiva, and went against current beliefs that it was not possible to incorporate all of the linear connectives, e.g.Expand
Taylor expansion in linear logic is invertible
  • D. Carvalho
  • Computer Science, Mathematics
  • Log. Methods Comput. Sci.
  • 2018
It is proved that two different MELL proof-nets have two different Taylor expansions, which is its Taylor expansion, and it is shown that the relational model is injective for MELLProof-nets, i.e. the equality between MELL Proof-nets in the relational models is exactly axiomatized by cut-elimination. Expand
The topology of solution spaces of combinatorial problems
Graph homomorphism is a notion almost as simple, notationally and conceptually, as graph coloring, but one that gives a rich mathematical structure, allowing for new fruitful connections with algebraExpand


No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
It is shown that MLL proof equivalence is PSPACE-complete, using a reduction from Nondeterministic Constraint Logic, and the existence of a satisfactory notion of proof nets for MLL with units is ruled out. Expand
Constant-Only Multiplicative Linear Logic is NP-Complete
The decision problem for the multiplicative fragment of linear logic without quantifiers or propositions: the constant-only case is studied, and it is shown that this fragment is NP-complete. Expand
Proof Nets for Additive Linear Logic with Units
  • W. Heijltjes
  • Computer Science, Mathematics
  • 2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
Additive linear logic, the fragment of linear logic concerning linear implication between strictly additive formulae, coincides with sum-product logic, the internal language of categories with freeExpand
From Proof Nets to the Free *-Autonomous Category
A theory of proof nets for full multiplicative linear logic, including the two units, and it is shown that the identifications enforced on proofs are such that the class of two-conclusion proof nets defines the free *-autonomous category. Expand
Decision Problems for Propositional Linear Logic
It is shown that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable, and it is proved that without the modal storage operator, which indicates unboundedness of resources, the decision problem becomes PSPACE-complete. Expand
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
The main result is that classic unrestricted sliding-block puzzles are PSPACE-hard, even if the pieces are restricted to be all dominoes (1 × 2 blocks) and the goal is simply to move a particular piece. Expand
Fucusing and Proof-Nets in Linear and Non-commutative Logic
It is shown here that Focusing can also be interpreted in the proof-net formalism, where it appecirs, at least in the multiplicative fragment, to be a simple refinement of the "Splitting lemma" for proof-nets. Expand
On Proof Nets for Multiplicative Linear Logic with Units
A theory of proof nets for full multiplicative linear logic, including the two units, is presented, which naturally extends the well-known theory of unit-free multiplicative proof nets. Expand
Canonical Sequent Proofs via Multi-Focusing
This paper recovers permutative canonicity directly in the cut-free sequent calculus by generalizing focused sequent proofs to admit multiple foci, and then considering the restricted class of maximally multi-focused proofs. Expand
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
The question of developing a computational interpretation of J. Girard's (1987) linear logic and obtaining efficient decision algorithms for this logic, based on the bottom-up approach, is addressed and it is proved that this fragment is NP-complete. Expand