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
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
Proof nets for unit-free multiplicative-additive linear logic
ACM Transactions on Computational Logic (TOCL)
Fast verification of MLL proof nets via IMLL
ACM Transactions on Computational Logic (TOCL)
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 5.23 |
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a linear logic proof structure is NL-complete.