Theoretical Computer Science
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
A Purely Logical Account of Sequentiality in Proof Search
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A Local System for Classical Logic
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A system of interaction and structure IV: The exponentials and decomposition
ACM Transactions on Computational Logic (TOCL)
Reducing nondeterminism in the calculus of structures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.01 |
In this paper I will present a deductive system for linear logic, in which all rules are local. In particular, the contraction rule is reduced to an atomic version, and there is no global promotion rule. In order to achieve this, it is necessary to depart from the sequent calculus and use the calculus of structures, which is a generalization of the one-sided sequent calculus. In a rule, premise and conclusion are not sequents, but structures, which are expressions that share properties of formulae and sequents.