Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Communication and Concurrency
A Purely Logical Account of Sequentiality in Proof Search
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A Non-commutative Extension of Classical Linear Logic
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
On structuring proof search for first order linear logic
Theoretical Computer Science
A system of interaction and structure
ACM Transactions on Computational Logic (TOCL)
On Linear Logic Planning and Concurrency
Language and Automata Theory and Applications
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
On linear logic planning and concurrency
Information and Computation
A characterization of medial as rewriting rule
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A system of interaction and structure IV: The exponentials and decomposition
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 5.23 |
The calculus of structures is a new proof theoretical formalism, like natural deduction, the sequent calculus and proof nets, for specifying logical systems syntactically. In a rule in the calculus of structures, the premise as well as the conclusion are structures, which are expressions that share properties of formulae and sequents. In this paper, I study a system for MELL, the multiplicative exponential fragment of linear logic, in the calculus of structures. It has the following features: a local promotion rule, no non-deterministic splitting of the context in the times rule and a modular proof for the cut elimination theorem. Further, derivations have a new property, called decomposition, that cannot be observed in any other known proof theoretical formalism.