Theoretical Computer Science
Communication and concurrency
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
A Non-commutative Extension of Classical Linear Logic
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Non-commutative logic II: sequent calculus and phase semantics
Mathematical Structures in Computer Science
A Purely Logical Account of Sequentiality in Proof Search
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Using Linear Logic to Reason about Sequent Systems
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
What is the problem with proof nets for classical logic?
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A system of interaction and structure IV: The exponentials and decomposition
ACM Transactions on Computational Logic (TOCL)
Nested proof search as reduction in the Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Reducing nondeterminism in the calculus of structures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Deep inference and its normal form of derivations
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of multiplicative linear logic, by a self-dual noncommutative operator inspired by CCS, that seems not to be expressible in the sequent calculus. Then we show that multiplicative exponential linear logic benefits from its presentation in the calculus of structures, especially because we can replace the ordinary, global promotion rule by a local version. These formal systems, for which we prove cut elimination, outline a range of techniques and properties that were not previously available. Contrarily to what happens in the sequent calculus, the cut elimination proof is modular.