A PSPACE-complete fragment of second-order linear logic
decision procedurefragmentinference permutability in proofsPSPACE-completesecond-order linear logic without exponentials
Decidability of theories and sets of sentences (03B25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Complexity of computation (including implicit computational complexity) (03D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
- scientific article; zbMATH DE number 1163987 (Why is no real title available?)
- scientific article; zbMATH DE number 1499088 (Why is no real title available?)
- Logic Programming with Focusing Proofs in Linear Logic
- On proof normalization in linear logic
- The undecidability of second order linear logic without exponentials
- The undecidability of second order multiplicative linear logic
This page was built for publication: A PSPACE-complete fragment of second-order linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960427)