2026-07-23T03:21:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3672 2024-03-06T10:34:21Z ddc:004 open_access

A Systematic Approach to Canonicity in the Classical Sequent Calculus Chaudhuri, Kaustuv Hetzl, Stefan Miller, Dale Sequent Calculus Canonicity Classical Logic Expansion Trees The sequent calculus is often criticized for requiring proofs to contain large amounts of low-level syntactic details that can obscure the essence of a given proof. Because each inference rule introduces only a single connective, sequent proofs can separate closely related steps-such as instantiating a block of quantifiers-by irrelevant noise. Moreover, the sequential nature of sequent proofs forces proof steps that are syntactically non-interfering and permutable to nevertheless be written in some arbitrary order. The sequent calculus thus lacks a notion of canonicity: proofs that should be considered essentially the same may not have a common syntactic form. To fix this problem, many researchers have proposed replacing the sequent calculus with proof structures that are more parallel or geometric. Proof-nets, matings, and atomic flows are examples of such revolutionary formalisms. We propose, instead, an evolutionary approach to recover canonicity within the sequent calculus, which we illustrate for classical first-order logic. The essential element of our approach is the use of a multi-focused sequent calculus as the means of abstracting away the details from classical cut-free sequent proofs. We show that, among the multi-focused proofs, the maximally multi-focused proofs that make the foci as parallel as possible are canonical. Moreover, such proofs are isomorphic to expansion proofs - a well known, minimalistic, and parallel generalization of Herbrand disjunctions - for classical first-order logic. This technique is a systematic way to recover the desired essence of any sequent proof without abandoning the sequent calculus. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kaustuv Chaudhuri and Stefan Hetzl and Dale Miller 2012 Is Part Of LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2012.183 urn:nbn:de:0030-drops-36723 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.183 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode