Towards the Automated Generation of Focused Proof Systems

  title={Towards the Automated Generation of Focused Proof Systems},
  author={Vivek Nigam and Giselle Reis and Leonardo Lima},
  • Vivek Nigam, Giselle Reis, Leonardo Lima
  • Published in WoF'15 2015
  • Mathematics, Computer Science
  • This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search non-determinism. We demonstrate that it is possible to construct a complete focused proof system from a given un-focused proof system if it satisfies some conditions. Our key idea is to generalize the completeness proof based on permutation lemmas given by Miller and… CONTINUE READING

    Topics from this paper.

    NLQ: a modular type-logical grammar for quantifier movement, scope islands, and more


    Publications referenced by this paper.
    Logic Programming with Focusing Proofs in Linear Logic
    • 748
    • Highly Influential
    • PDF
    Contraction-Free Sequent Calculi for Intuitionistic Logic
    • 310
    • PDF
    Focusing and polarization in linear, intuitionistic, and classical logics
    • 171
    • PDF
    Focusing and Polarization in Intuitionistic Logic
    • 85
    • Highly Influential
    • PDF
    From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
    • 62
    • Highly Influential
    • PDF
    Exploiting non-canonicity in the sequent calculus
    • 19
    Quati: An Automated Tool for Proving Permutation Lemmas
    • 5
    • PDF
    Checking Proof Transformations with ASP
    • 3
    • PDF
    2007):From proofs to focused proofs: a modular proof of focalizati on in Linear Logic
    • 2007
    A linear approach to the proof-theory of least and greatest fi xed points
    • 2008