# A system of interaction and structure

@article{Guglielmi2007ASO, title={A system of interaction and structure}, author={A. Guglielmi}, journal={ACM Trans. Comput. Log.}, year={2007}, volume={8}, pages={1} }

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… Expand

#### Figures and Topics from this paper

#### 248 Citations

A system of interaction and structure IV: The exponentials and decomposition

- Mathematics, Computer Science
- TOCL
- 2011

A basic compositionality property of NEL is shown, which leads to a cut-elimination theorem, which is proved in the next article of this series. Expand

A system of interaction and structure V: the exponentials and splitting

- Computer Science, Mathematics
- Mathematical Structures in Computer Science
- 2011

The splitting theorem shows how and to what extent the authors can recover a sequent-like structure in NEL proofs and yields a cut-elimination procedure for NEL. Expand

A System of Interaction and Structure II: The Need for Deep Inference

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2006

In this paper, deep inference is shown to be crucial for the logic BV, that is, any restriction on the ``depth'' of the inference rules of BV would result in a strictly less expressive logical system. Expand

Subatomic Proof Systems

- Computer Science
- ACM Trans. Comput. Log.
- 2018

This article defines and considers splittable systems, which essentially make up a large class of linear logics, including Multiplicative Linear Logic and BV, and proves a splitting theorem, guaranteeing cut elimination and other admissibility results as corollaries. Expand

Reducing Nondeterminism in the Calculus of Structures

- Computer Science
- LPAR
- 2006

A new technique is introduced which reduces nondeterminism without breaking proof theoretical properties and provides a more immediate access to shorter proofs in the calculus of structures. Expand

Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic

- Computer Science
- TLCA
- 2009

This paper provides two new aspects of the proof theory of MLL2 with units that give a novel proof system in the framework of the calculus of structures and shows a new notion of proof nets which is independent from any deductive system. Expand

A Proof Calculus Which Reduces Syntactic Bureaucracy

- Mathematics, Computer Science
- RTA
- 2010

A logic-independent proof calculus, where proofs can be freely composed by connectives, and prove its basic properties, which allows to avoid certain types of syntactic bureaucracy inherent to all usual proof systems. Expand

A Subatomic Proof System

- 2014

In this work we show a proof system, called SA, that generates propositional proofs by employing a single, linear, simple and regular inference rule scheme. The main idea is to consider atoms as… Expand

On noncommutative extensions of linear logic

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2019

A variant of sequent calculus formulation for Pomset logic is given, which is one of the key results of the paper. Expand

Locality for Classical Logic

- Mathematics, Computer Science
- Notre Dame J. Formal Log.
- 2006

D deductive systems for classical propositional and predicate logic in the calculus of structures are seen, which have a cut rule which is admissible and which leads to inference rules that are local : they do not require the inspection of expressions of arbitrary size. Expand

#### References

SHOWING 1-10 OF 58 REFERENCES

Non-commutativity and MELL in the Calculus of Structures

- Mathematics, Computer Science
- CSL
- 2001

The calculus of structures is introduced: it is more general than the sequent calculus and it allows for cut elimination and the subformula property, and it is shown that multiplicative exponential linear logic benefits from its presentation in the calculus of structure. Expand

MELL in the calculus of structures

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2003

This paper studies a system for MELL, the multiplicative exponential fragment of linear logic, in the calculus of structures, which 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. Expand

Implementing system BV of the calculus of structures in Maude

- Computer Science
- 2004

It is argued that plans can be expressed as logical formulae by using the sequential operator of BV and reason on them in a purely logical way. Expand

A Non-commutative Extension of MELL

- Mathematics, Computer Science
- LPAR
- 2002

The extended multiplicative exponential linear logic (M EL)L is extended by a non-commutative, self-dual logical operator defined in the formalism of the calculus of structures, which is a generalisation of the sequent calculus and provides a more refined analysis of proofs. Expand

Implementing System BV of the Calculus of Structures in Maude

- Mathematics
- 2004

System BV is an extension of multiplicative linear logic with a non-commutative self-dual operator. We flrst map derivations of system BV of the calculus of structures to rewritings in a term… Expand

Properties of a Logical System in the Calculus of Structures

- Mathematics
- 2001

The calculus of structures is a new framework for presenting logical systems. It is a generalisation of a traditional framework, the one-sided sequent calculus. One of the main features of the… Expand

A Local System for Classical Logic

- Computer Science
- LPAR
- 2001

The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general, and a system of inference rules for propositional classical logic is presented, with the main novelty that all the rules are local. Expand

Non-commutative logic II: sequent calculus and phase semantics

- Computer Science, Mathematics
- Mathematical Structures in Computer Science
- 2000

Two equivalent versions of the sequent calculus are given directly with the structure of order varieties, and with their presentations as partial orders, phase semantics and a cut-elimination theorem are given. Expand

A Local System for Linear Logic

- Computer Science
- LPAR
- 2002

A deductive system for linear logic, in which all rules are local, and the contraction rule is reduced to an atomic version, and there is no global promotion rule. Expand

A System of Interaction and Structure II: The Need for Deep Inference

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2006

In this paper, deep inference is shown to be crucial for the logic BV, that is, any restriction on the ``depth'' of the inference rules of BV would result in a strictly less expressive logical system. Expand