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

Onderzoeksoutput: ScriptieDissertatie 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-2Engels
KwalificatieDoctor in de Filosofie
Toekennende instantie
  • Utrecht University
Begeleider(s)/adviseur
  • Moerdijk, I., Promotor, Externe Persoon
  • Schellinx, H., Co-Promotor, Externe Persoon
Datum van toekenning26 jan 2001
Plaats van publicatieUtrecht
Uitgever
Gedrukte ISBN's90-393-2614-2
StatusGepubliceerd - 2001

Citeer dit