Canonical Sequent Proofs via Multi Focusing

-

English
15 Pages
Gain access to the library to view online
Learn more

Description

Niveau: Supérieur
Canonical Sequent Proofs via Multi-Focusing Kaustuv Chaudhuri, Dale Miller, and Alexis Saurin Abstract The sequent calculus admits many proofs of the same conclusion that differ only by trivial permutations of inference rules. In order to eliminate this “bu- reaucracy” from sequent proofs, deductive formalisms such as proof nets or natural deduction are usually used instead of the sequent calculus, for they identify proofs more abstractly and geometrically. In this paper we recover permutative canonicity directly in the cut-free sequent calculus by generalizing focused sequent proofs to admit multiple foci, and then considering the restricted class of maximally multi- focused proofs. We validate this definition by proving a bijection to the well-known proof-nets for the unit-free multiplicative linear logic, and discuss the possibility of a similar correspondence for larger fragments. 1 Introduction Sequent calculus proofs are much less proof objects than they are traces of the com- putation of a more abstract proof object. In particular, the infernece rules of the sequent calculus are minute and there are many choices in the order of their applica- tion that seem equivalent although, formally, they result in different sequent proofs. One way to get a more abstract notion of proof is to declare that two cut-free proofs are equivalent if it is possible to permute the inference rules in one to get the other. Such equivalence classes are unsatisfactory for at least two reasons.

• inference rules

• consider only

• multi-focused proofs

• when deciding

• rule

• problematic when

• local permutation

• rules

Subjects

Rule of inference

Informations

 Published by Reads 13 Language English
Report a problem
CanonicalSequentProofsviaMulti-FocusingKaustuvChaudhuri,DaleMiller,andAlexisSaurinAbstractThesequentcalculusadmitsmanyproofsofthesameconclusionthatdieronlybytrivialpermutationsofinferencerules.Inordertoeliminatethisbu-reaucracyfromsequentproofs,deductiveformalismssuchasproofnetsornaturaldeductionareusuallyusedinsteadofthesequentcalculus,fortheyidentifyproofsmoreabstractlyandgeometrically.Inthispaperwerecoverpermutativecanonicitydirectlyinthecut-freesequentcalculusbygeneralizingfocusedsequentproofstoadmitmultiplefoci,andthenconsideringtherestrictedclassofmaximallymulti-focusedproofs.Wevalidatethisdenitionbyprovingabijectiontothewel-knownproof-netsfortheunit-freemultiplicativelinearlogic,anddiscussthepossibilityofasimilarcorrespondenceforlargerfragments.1IntroductionSequentcalculusproofsaremuchlessproofobjectsthantheyaretracesofthecom-putationofamoreabstractproofobject.Inparticular,theinfernecerulesofthesequentcalculusareminuteandtherearemanychoicesintheorderoftheirapplica-tionthatseemequivalentalthough,formally,theyresultindierentsequentproofs.Onewaytogetamoreabstractnotionofproofistodeclarethattwocut-freeproofsareequivalentifitispossibletopermutetheinferencerulesinonetogettheother.Suchequivalenceclassesareunsatisfactoryforatleasttworeasons.First,com-putingpermutationsofinferencerulesmightrequireexaminingandreorganizingKaustuvChaudhuriINRIASaclayIle-de-France,e-mail:Kaustuv.Chaudhuri@inria.frDaleMillerINRIASaclayIle-de-France&LIX,E´colePolytechnique,e-mail:Dale.Miller@inria.frAlexisSaurinINRIASaclayIle-de-France&LIX,E´colePolytechnique,e-mail:Alexis.Saurin@inria.fr1
en expand_more