Focusing in linear meta-logic

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

Abstract

It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a variety of sequent calculus proof systems. Here, we show that if we adopt different focusing annotations for such linear logic specifications, a range of other proof systems can also be specified. In particular, we show that natural deduction (normal and non-normal), sequent proofs (with and without cut), tableaux, and proof systems using general elimination and general introduction rules can all be derived from essentially the same linear logic specification by altering focusing annotations. By using elementary linear logic equivalences and the completeness of focused proofs, we are able to derive new and modular proofs of the soundness and completeness of these various proofs systems for intuitionistic and classical logics.

Original languageEnglish
Title of host publicationAutomated Reasoning - 4th International Joint Conference, IJCAR 2008, Proceedings
Pages507-522
Number of pages16
DOIs
Publication statusPublished - 7 Oct 2008
Event4th International Joint Conference on Automated Reasoning, IJCAR 2008 - Sydney, NSW, Australia
Duration: 12 Aug 200815 Aug 2008

Publication series

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

Conference

Conference4th International Joint Conference on Automated Reasoning, IJCAR 2008
Country/TerritoryAustralia
CitySydney, NSW
Period12/08/0815/08/08

Fingerprint

Dive into the research topics of 'Focusing in linear meta-logic'. Together they form a unique fingerprint.

Cite this