Quadratic Correctness Criterion for Non-commutative Logic

Authors:
Virgile Mogbil
Affiliations:
-
Venue:
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Year:
2001

Citing 5
Cited 1

Linear logic

Theoretical Computer Science
Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic

Journal of Symbolic Logic
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
Correctness of Multiplicative Proof Nets is Linear

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Non-commutative logic II: sequent calculus and phase semantics

Mathematical Structures in Computer Science

LINK: A Proof Environment Based on Proof Nets

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multiplicative fragment of Non commutative Logic (called MNL) has a proof nets theory [AR00] with a correctness criterion based on long trips for cut-free proof nets. Recently, R. Maieli has developed another criterion in the Danos-Regnier style [Mai00]. Both are in exponential time. We give a quadratic criterion in the Danos contractibility criterion style.