Correctness of multiplicative (and exponential) proof structures is NL-complete

Authors:
Paulin Jacobé De Naurois;Virgile Mogbil
Affiliations:
LIPN, UMR, CNRS, Université Paris 13, Villetaneuse, France;LIPN, UMR, CNRS, Université Paris 13, Villetaneuse, France
Venue:
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Year:
2007

Citing 9
Cited 2

Problems complete for deterministic logarithmic space

Journal of Algorithms
Linear logic

Theoretical Computer Science
Nondeterministic space is closed under complementation

SIAM Journal on Computing
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
Parsing MELL proof nets

Theoretical Computer Science
Correctness of Multiplicative Proof Nets is Linear

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Dominator Trees and Fast Verification of Proof Nets

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast verification of MLL proof nets via IMLL

ACM Transactions on Computational Logic (TOCL)

A linear algorithm for MLL proof net correctness and sequentialization

Theoretical Computer Science
Proof Nets for Herbrand’s Theorem

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

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 NL- complete. We also prove that deciding the correctness of an intuitionistic multiplicative essential net is NL-complete.