Sequents and link graphs : contraction criteria for refinements of multiplicative linear logic

G.W.Q. Puite

Sequents and link graphs : contraction criteria for refinements of multiplicative linear logic

Mathematics and Computer Science

Research output: Thesis › Phd Thesis 4 Research NOT TU/e / Graduation NOT TU/e)

Abstract

In this thesis we investigate certain structural refinements of multiplicative linear logic, obtained by removing structural rules like commutativity and associativity, in addition to the removal of weakening and contraction, which characterizes linear logic. We define a notion of sequent that is able to capture these subtle structural distinctions. For each of our calculi (MLL, NCLL, CNL, and NL

Original language	English
Qualification	Doctor of Philosophy
Awarding Institution	Utrecht University
Supervisors/Advisors	Moerdijk, I., Promotor, External person Schellinx, H., Copromotor, External person
Award date	26 Jan 2001
Place of Publication	Utrecht
Publisher	Utrecht University
Print ISBNs	90-393-2614-2
Publication status	Published - 2001

Cite this

@phdthesis{5105b2667b9746088e51fbe00e3c3da8,

title = "Sequents and link graphs : contraction criteria for refinements of multiplicative linear logic",

abstract = "In this thesis we investigate certain structural refinements of multiplicative linear logic, obtained by removing structural rules like commutativity and associativity, in addition to the removal of weakening and contraction, which characterizes linear logic. We define a notion of sequent that is able to capture these subtle structural distinctions. For each of our calculi (MLL, NCLL, CNL, and NL",

author = "G.W.Q. Puite",

year = "2001",

language = "English",

isbn = "90-393-2614-2",

publisher = "Utrecht University",

address = "Netherlands",

school = "Utrecht University",

}

TY - THES

T1 - Sequents and link graphs : contraction criteria for refinements of multiplicative linear logic

AU - Puite, G.W.Q.

PY - 2001

Y1 - 2001

N2 - In this thesis we investigate certain structural refinements of multiplicative linear logic, obtained by removing structural rules like commutativity and associativity, in addition to the removal of weakening and contraction, which characterizes linear logic. We define a notion of sequent that is able to capture these subtle structural distinctions. For each of our calculi (MLL, NCLL, CNL, and NL

AB - In this thesis we investigate certain structural refinements of multiplicative linear logic, obtained by removing structural rules like commutativity and associativity, in addition to the removal of weakening and contraction, which characterizes linear logic. We define a notion of sequent that is able to capture these subtle structural distinctions. For each of our calculi (MLL, NCLL, CNL, and NL

UR - http://igitur-archive.library.uu.nl/dissertations/1947108/UUindex.html

M3 - Phd Thesis 4 Research NOT TU/e / Graduation NOT TU/e)

SN - 90-393-2614-2

PB - Utrecht University

CY - Utrecht

ER -

Sequents and link graphs : contraction criteria for refinements of multiplicative linear logic

Abstract

Other files and links

Fingerprint

Cite this