Theoretical Computer Science
Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Proof construction and non-commutativity: a cluster calculus
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Fucusing and Proof-Nets in Linear and Non-commutative Logic
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Non-commutative Extension of MELL
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Quadratic Correctness Criterion for Non-commutative Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Non-commutativity and MELL in the Calculus of Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Non-commutative Logic for Hand-Written Character Modeling
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Towards a semantics of proofs for non-commutative logic: multiplicatives and additives
Theoretical Computer Science - Linear logic
Non-commutative logic III: focusing proofs
Information and Computation
Mathematical Structures in Computer Science
A system of interaction and structure
ACM Transactions on Computational Logic (TOCL)
Cyclic Extensions of Order Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
Permutative additives and exponentials
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
| Hi-index | 0.00 |
Non-commutative logic, which is a unification of commutative linear logic and cyclic linear logic, is extended to all linear connectives: additives, exponentials and constants. We give two equivalent versions of the sequent calculus (directly with the structure of order varieties, and with their presentations as partial orders), phase semantics and a cut-elimination theorem. This involves, in particular, the study of the entropy relation between partial orders, and the introduction of a special class of order varieties: the series–parallel order varieties.