A multi-focused proof system isomorphic to expansion proofs

  title={A multi-focused proof system isomorphic to expansion proofs},
  author={Kaustuv Chaudhuri and Stefan Hetzl and Dale Miller},
  journal={J. Log. Comput.},
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… 

Figures from this paper

From focussed proof systems to complexity bounds
A notion of ‘over-focussing’ that admits non-branching invertible rules during synchronous phases is proposed, due to the fact that deterministic computations can equally be carried out by a nondeterministic machine.
Alternating time bounds from variants of focussed proof systems Intuitionistic logic and the polynomial hierarchy
A notion of ‘over-focussing’ that admits non-branching invertible rules during synchronous phases is proposed, due to the fact that deterministic computations can equally be carried out by a nondeterministic machine.
Focused and Synthetic Nested Sequents (Extended Technical Report)
A focused cut-elimination theorem for focused nested sequents is among the key contributions, which improves the reach of focusing to the most commonly studied modal logics, the logics of the modal S5 cube.
Modular normalisation of classical proofs
A local cycle removal procedure through reductions on merge contractions is shown that ensures that proofs can be decomposed—that contractions can be pushed to the bottom of a proof—in a straightforward way.
Herbrand Proofs and Expansion Proofs as Decomposed Proofs
  • B. Ralph
  • Mathematics, Philosophy
    J. Log. Comput.
  • 2020
This paper constructs simple deep inference systems for first-order logic, both with and without cut, such that ‘decomposed’ proofs—proofs where the contractive and non-contractive behaviour of the proof is separated—in each system correspond to either expansion proofs or Herbrand proofs.
A Semantic Framework for Proof Evidence
The foundational proof certificates (FPC) framework is proposed, which allows both producers of proof certificates and the checkers of those certificates to have a clear formal definition of the semantics of a wide variety of proof evidence.
A general proof certification framework for modal logic
This work proposes here a general framework for checking modal proofs using a classical focused sequent calculus as a kernel and presents the implementation of the framework in a Prolog-like language and shows how it is possible to specialize it in a simple and modular way in order to cover different proof formalisms.
Modal proof theory through a focused telescope
In this thesis, we use in two ways the concept of synthetic inference rules that can be obtained from a focused proof system; from one side of the “telescope”, focusing allows us to analyse the
Two Applications of Logic Programming to Coq
This paper implements in Elpi a proof checker for first-order intuitionistic logic and demonstrates how proof certificates can be supplied by external Coq provers and then elaborated into the fully detailed proof terms that can be checked by the Coq kernel.
Applications of Foundational Proof Certificates in theorem proving. (Applications des Certificats de Preuve Fondamentaux à la démonstration automatique de théorèmes)
This thesis extends initial results in certification of first-order proofs in several directions and applies developments to fully certify results produced by two families of standard automated theorem provers: resolution- and satisfiability-based.


Canonical Sequent Proofs via Multi-Focusing
This paper recovers 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.
A Proof Calculus Which Reduces Syntactic Bureaucracy
A logic-independent proof calculus, where proofs can be freely composed by connectives, and prove its basic properties, which allows to avoid certain types of syntactic bureaucracy inherent to all usual proof systems.
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
A new proof of the completeness of focused proofs in terms of proof transformation is given, first proved for MALL and then extended to full linear logic, and it is shown how the proof can be extended to larger systems, such as logics with induction.
Logic Programming with Focusing Proofs in Linear Logic
It is shown that the syntactic restriction induced by LinLog is not performed at the cost of any expressive power: a mapping from full linear logic to LinLog, preserving focusing proofs, and analogous to the normalization to clausal form for classical logic, is presented.
A compact representation of proofs
This paper is able to prove a strengthen form of the firstorder interpolation theorem as well as provide a correct description of Skolem functions and the Herbrand Universe.
Proof search issues in some non-classical logics
This thesis develops techniques and ideas on proof search into issues in proof search in both these senses for some non-classical logics and develops calculi developed with logic programming in mind.
Classical proof forestry
Proof Nets for Herbrand’s Theorem
Herbrand’s theorem is explored as the source of a natural notion of abstract proof object for classical logic, embodying the “essence” of a sequent calculus proof.
Uniform Proofs as a Foundation for Logic Programming
Focusing and polarization in linear, intuitionistic, and classical logics