Abstract
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof structure is NLcomplete. We also prove that deciding the correctness of an intuitionistic multiplicative essential net is NL-complete. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
De Naurois, P. J., & Mogbil, V. (2007). Correctness of multiplicative (and exponential) proof structures is NL-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4646 LNCS, pp. 435–450). https://doi.org/10.1007/978-3-540-74915-8_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
