Some observations on the proof theory of second order propositional multiplicative linear logic

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

Abstract

We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new aspects of the proof theory of MLL2 with units. First, we give a novel proof system in the framework of the calculus of structures. The main feature of the new system is the consequent use of deep inference, which allows us to observe a decomposition which is a version of Herbrand's theorem that is not visible in the sequent calculus. Second, we show a new notion of proof nets which is independent from any deductive system. We have " sequentialisation" into the calculus of structures as well as into the sequent calculus. Since cut elimination is terminating and confluent, we have a category of MLL2 proof nets. The treatment of the units is such that this category is star-autonomous.

Original languageEnglish
Title of host publicationTyped Lambda Calculi and Applications - 9th International Conference, TLCA 2009, Proceedings
Pages309-324
Number of pages16
DOIs
Publication statusPublished - 9 Nov 2009
Event9th International Conference on Typed Lambda Calculi and Applications, TLCA 2009 - Brasilia, Brazil
Duration: 1 Jul 20093 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5608 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Typed Lambda Calculi and Applications, TLCA 2009
Country/TerritoryBrazil
CityBrasilia
Period1/07/093/07/09

Fingerprint

Dive into the research topics of 'Some observations on the proof theory of second order propositional multiplicative linear logic'. Together they form a unique fingerprint.

Cite this