Correctness of Multiplicative Additive Proof Structures is NL-Complete

The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.

Saved in:
Bibliographic Details
Published in:2008 23rd Annual IEEE Symposium on Logic in Computer Science pp. 476 - 485
Main Authors: de Naurois, P.J., Mogbil, V.
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2008
Subjects:
Additives
Calculus
Complexity theory
Computational Complexity
Computer science
Correctness Criterion
Jacobian matrices
Logic
Multiplicative Additive Linear Logic
NL-completness
Parallel algorithms
proof-nets
ISBN:9780769531830, 0769531830
ISSN:1043-6871
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.
ISBN:9780769531830
0769531830
ISSN:1043-6871
DOI:10.1109/LICS.2008.20