First-order linear logic without modalities is NEXPTIME-hard

This publication has 11 references indexed in Scilit:

• Proof search in first-order linear logic and other cut-free sequent calculi
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Logic programming in a fragment of intuitionistic linear logic
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Constant-only multiplicative linear logic is NP-complete
  Theoretical Computer Science, 1994
• Linearizing intuitionistic implication
  Annals of Pure and Applied Logic, 1993
• The π-calculus as a theory in linear logic: Preliminary results
  Published by Springer Nature ,1993
• Logic Programming with Focusing Proofs in Linear Logic
  Journal of Logic and Computation, 1992
• Decision problems for propositional linear logic
  Annals of Pure and Applied Logic, 1992
• Linear objects: Logical processes with built-in inheritance
  New Generation Computing, 1991
• Linear logic
  Theoretical Computer Science, 1987
• Alternation and the computational complexity of logic programs
  The Journal of Logic Programming, 1984