Quati: An Automated Tool for Proving Permutation Lemmas

The proof of many foundational results in structural proof theory, such as the admissibility of the cut rule and the completeness of the focusing discipline, rely on permutation lemmas. It is often a tedious and error prone task to prove such lemmas as they involve many cases. This paper describes the tool Quati which is an automated tool capable of proving a wide range of inference rule permutations for a great number of proof systems. Given a proof system specification in the form of a theory in linear logic with subexponentials, Quati outputs in Open image in new window the permutation transformations for which it was able to prove correctness and also the possible derivations for which it was not able to do so. As illustrated in this paper, Quati’s output is very similar to proof derivation figures one would normally find in a proof theory book.

[1]  Gerhard Gentzen,et al.  Investigations into Logical Deduction , 1970 .

[2]  Vincent Danos,et al.  Computer Science Logic , 1993, Lecture Notes in Computer Science.

[3]  Shôji Maehara,et al.  Eine Darstellung der Intuitionistischen Logik in der Klassischen , 1954, Nagoya Mathematical Journal.

[4]  M. E. Szabo,et al.  The collected papers of Gerhard Gentzen , 1969 .

[5]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[6]  Tristan Crolard,et al.  Subtractive logic , 2001, Theor. Comput. Sci..

[7]  Vivek Nigam,et al.  Checking Proof Transformations with ASP , 2013, Theory Pract. Log. Program..

[8]  Jacques Herbrand.  Recherches sur la théorie de la démonstration , 1930 .

[9]  Cecylia Rauszer,et al.  A formalization of the propositional calculus of H-B logic , 1974 .

[10]  Elaine Pimentel,et al.  An extended framework for specifying and reasoning about proof systems , 2016, J. Log. Comput..

[11]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[12]  Dale Miller,et al.  From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic , 2007, CSL.

[13]  Helmut Schwichtenberg,et al.  Basic proof theory , 1996, Cambridge tracts in theoretical computer science.

[14]  Vivek Nigam.  On the Complexity of Linear Authorization Logics , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[15]  Dale Miller,et al.  Algorithmic specifications in linear logic with subexponentials , 2009, PPDP '09.

[16]  Dale Miller,et al.  A Framework for Proof Systems , 2010, Journal of Automated Reasoning.