No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete

Full Text: PDFPDF Get this ArticleGet this Article
Authors: Willem Heijltjes University of Bath
Robin Houston Kiln Enterprises
Published in:
· Proceeding
CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Article No. 50

Vienna, Austria — July 14 - 18, 2014
ACM New York, NY, USA ©2014
table of contents ISBN: 978-1-4503-2886-9 doi>10.1145/2603088.2603126
No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete Published by ACM 2014 Article
Bibliometrics Data  Bibliometrics
· Citation Count: 3
· Downloads (cumulative): 45
· Downloads (12 Months): 2
· Downloads (6 Weeks): 0


Author Tags Expand Author Tags
Contact The DL Team Contact Us | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us