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

Research output: ThesisPhd Thesis 4 Research NOT TU/e / Graduation NOT TU/e)


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 languageEnglish
QualificationDoctor of Philosophy
Awarding Institution
  • Utrecht University
  • Moerdijk, I., Promotor, External person
  • Schellinx, H., Copromotor, External person
Award date26 Jan 2001
Place of PublicationUtrecht
Print ISBNs90-393-2614-2
Publication statusPublished - 2001

Cite this