A local system for linear logic

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

Abstract

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.

Original languageEnglish
Title of host publicationLogic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings
EditorsAndrei Voronkov, Matthias Baaz
PublisherSpringer Verlag
Pages388-402
Number of pages15
ISBN (Print)3540000100, 9783540000105
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 local system for linear logic'. Together they form a unique fingerprint.

Cite this