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

Onderzoeksoutput: Scriptie › Dissertatie 4 (Onderzoek NIET TU/e / Promotie NIET TU/e)

Samenvatting

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

Originele taal-2	Engels
Kwalificatie	Doctor in de Filosofie
Toekennende instantie	Utrecht University
Begeleider(s)/adviseur	Moerdijk, I., Promotor, Externe Persoon Schellinx, H., Co-Promotor, Externe Persoon
Datum van toekenning	26 jan. 2001
Plaats van publicatie	Utrecht
Uitgever	Utrecht University
Gedrukte ISBN's	90-393-2614-2
Status	Gepubliceerd - 2001

Andere bestanden en links

full text

Citeer dit

@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

Samenvatting

Andere bestanden en links

Vingerafdruk

Citeer dit