Proof equivalence in MLL is PSPACE-complete
- Submitting institution
-
The University of Bath
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 145988381
- Type
- D - Journal article
- DOI
-
10.2168/LMCS-12(1:2)2016
- Title of journal
- Logical Methods in Computer Science
- Article number
- -
- First page
- 1
- Volume
- 12
- Issue
- 1
- ISSN
- 1860-5974
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 3
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Invited submission to a special issue collecting (expanded versions of) selected papers from the 2014 CSL-LICS conference: 9 papers were selected out of 74 presented at the conference. Answers in the negative the long-standing question (since 1987) whether there can be proof nets for the core fragment of classical linear logic. Proof nets are essential to the linear logic programme and their existence would be a main argument that MLL is well behaved; hence this is a profound result with serious implications. The paper is referenced in the article on Linear Logic in the Stanford Encyclopedia of Philosophy.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -