Abstract
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 
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. J. of Logic and Computation 2(3), 297–347 (1992)
Crolard, T.: Subtractive logic. Theor. Comput. Sci. 254(1-2), 151–185 (2001)
Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: ICLP (1990)
Gentzen, G.: Investigations into logical deductions. The Collected Papers of Gerhard Gentzen (1969)
Herbrand, J.: Recherches sur la Théorie de la Démonstration. PhD thesis (1930)
Maehara, S.: Eine darstellung der intuitionistischen logik in der klassischen. Nagoya Mathematical Journal, 45–64 (1954)
Miller, D., Saurin, A.: From proofs to focused proofs: a modular proof of focalization in linear logic. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 405–419. Springer, Heidelberg (2007)
Nigam, V., Pimentel, E., Reis, G.: An extended framework for specifying and reasoning about proof systems. Accepted to Journal of Logic and Computation, http://www.nigam.info/docs/modal-sellf.pdf
Nigam, V., Reis, G., Lima, L.: Quati: From linear logic specifications to inference rules (extended abstract). In: Brazilian Logic Conference, EBL (2014), http://www.nigam.info/docs/ebl14.pdf
Nigam, V.: On the complexity of linear authorization logics. In: LICS (2012)
Nigam, V., Miller, D.: Algorithmic specifications in linear logic with subexponentials. In: PPDP (2009)
Nigam, V., Miller, D.: A framework for proof systems. J. Autom. Reasoning 45(2), 157–188 (2010)
Nigam, V., Reis, G., Lima, L.: Checking proof transformations with ASP. In: ICLP (Technical Communications) (2013)
Rauszer, C.: A formalization of the propositional calculus h-b logic. Studia Logica (1974)
Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Nigam, V., Reis, G., Lima, L. (2014). Quati: An Automated Tool for Proving Permutation Lemmas. In: Demri, S., Kapur, D., Weidenbach, C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science(), vol 8562. Springer, Cham. https://doi.org/10.1007/978-3-319-08587-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-08587-6_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08586-9
Online ISBN: 978-3-319-08587-6
eBook Packages: Computer ScienceComputer Science (R0)