A non-commutative extension of MELL

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We extend multiplicative exponential linear logic (M E L) L by a non-commutative, self-dual logical operator.The extended system, called N EL, is 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. We should then be able to extend the range of applications of M E L,L by modelling a broad notion of sequentiality and providing new properties of proofs. We show some proof theoretical results: decomposition and cut elimination. The new operator represents a significant challenge: to get our results we use here for the first time some novel techniques, which constitute a uniform and modular approach to cut elimination, contrary to what is possible in the sequent calculus.

Original languageEnglish
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings
EditorsMatthias Baaz, Andrei Voronkov
PublisherSpringer Verlag
Pages231-246
Number of pages16
ISBN (Print)3540000100, 9783540000105
DOIs
Publication statusPublished - 1 Jan 2002
Externally publishedYes
Event9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002 - Tbilisi, Georgia
Duration: 14 Oct 200218 Oct 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2514
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002
Country/TerritoryGeorgia
CityTbilisi
Period14/10/0218/10/02

Fingerprint

Dive into the research topics of 'A non-commutative extension of MELL'. Together they form a unique fingerprint.

Cite this