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
Basic proof theory
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
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
MELL in the calculus of structures
Theoretical Computer Science
Non-commutative logic II: sequent calculus and phase semantics
Mathematical Structures in Computer Science
On structuring proof search for first order linear logic
Theoretical Computer Science
Canonical Abstract Syntax Trees
Electronic Notes in Theoretical Computer Science (ENTCS)
On Linear Logic Planning and Concurrency
Language and Automata Theory and Applications
Maude as a Platform for Designing and Implementing Deep Inference Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On the proof complexity of deep inference
ACM Transactions on Computational Logic (TOCL)
An Algorithmic Interpretation of a Deep Inference System
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Syntactic Cut-elimination for Common Knowledge
Electronic Notes in Theoretical Computer Science (ENTCS)
Deep Inference in Bi-intuitionistic Logic
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
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
On linear logic planning and concurrency
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A logical calculus for modelling interferences
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
A characterization of medial as rewriting rule
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Reasoning Processes in Propositional Logic
Journal of Logic, Language and Information
How to universally close the existential rule
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
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
Linear lambda calculus and deep inference
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
A local system for intuitionistic logic
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
On the specification of sequent systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
The taming of recurrences in computability logic through cirquent calculus, Part I
Archive for Mathematical Logic
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
| Hi-index | 0.02 |
This article introduces a logical system, called BV, which extends multiplicative linear logic by a noncommutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far, it is not achieved therein. It becomes very natural in a new formalism, called the calculus of structures, which is the main contribution of this work. Structures are formulas subject to certain equational laws typical of sequents. The calculus of structures is obtained by generalizing the sequent calculus in such a way that a new top-down symmetry of derivations is observed, and it employs inference rules that rewrite inside structures at any depth. These properties, in addition to allowing the design of BV, yield a modular proof of cut elimination.