Quati: An Automated Tool for Proving Permutation Lemmas

  title={Quati: An Automated Tool for Proving Permutation Lemmas},
  author={Vivek Nigam and Giselle Reis and Leonardo Lima},
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… 

Figures from this paper

Towards the Automated Generation of Focused Proof Systems
This paper demonstrates that it is possible to construct a complete focused proof system from a given un-focused proof system if it satisfies some conditions, and generalizes the completeness proof based on permutation lemmas given by Miller and Saurin for the focused linear logic proof system.
Proving Structural Properties of Sequent Systems in Rewriting Logic
The proposed techniques for proving structural properties of sequent systems are presented in the rewriting logic metalogical framework, and use rewrite- and narrowing-based reasoning.
A Rewriting Logic Approach to Specification, Proof-search, and Meta-proofs in Sequent Systems
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cutelimination, and identity expansion by offering both a formal specification language and offthe-shelf mechanization of the proof-search algorithms coming together with semidecision procedures for proving theorems and meta-theorems of the object system.
Sequoia: A Playground for Logicians
Sequoia is a web-based application for specifying sequent calculi and performing basic reasoning about them, and provides an intuitive interface where inference rules can be input in and are immediately rendered with the corresponding symbols.
Tools for the Investigation of Substructural , Intermediate and Paraconsistent Logics
Systematic and algorithmic procedures for the automated generation of analytic calculi to establish important properties for the formalized logics, and the introduction of the framework TINC (Tools for the Investigation of Non-Classical logics) to provide computer support for the contributions.
Automating Automated Reasoning - The Case of Two Generic Automated Reasoning Tools
The performance of the tools is evaluated, the results of a preliminary empirical study where user experiences of expert logicians using the two tools are compared are compared, and criteria relevant for comparing their performance and usability are examined.
Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II
This paper discusses the design of a hierarchy of structures which combine linear algebra with concepts related to limits, like topology and norms, in dependent type theory, and presents and discusses a solution, coined forgetful inheritance, based on packed classes and unification hints.
Facilitating Meta-Theory Reasoning (Invited Paper)
  • Giselle Reis
  • Computer Science
    Electronic Proceedings in Theoretical Computer Science
  • 2021
This paper will present some techniques that I have been involved in for facilitating meta-theory reasoning, and their combinatorial nature suggests they could be automated.


Checking Proof Transformations with ASP
The means to automatize the check of proof transformations by using Answer Set Prog ramming (ASP) are outlined.
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.
An extended framework for specifying and reasoning about proof systems
This paper shows how to extend the framework with subexponentials in order to declaratively encode a wider range of proof systems, including a number of non-trivial proof systems such as multi-conclusion intuitionistic logic, classical modal logic S4, intuitionistic Lax logic, and Negri’s labelled proof systems for different modal logics.
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 Framework for Proof Systems
It is shown that by providing different polarizations within a focused proof system for linear logic, one can account for natural deduction, sequent proofs, and tableaux proofs.
Algorithmic specifications in linear logic with subexponentials
This work shows that focused proof search can be precisely linked to a simple algorithmic specification language that contains while-loops, conditionals, and insertion into and deletion from multisets and proposes a new logical connective that allows for the creation of new subexponentials, thereby further augmenting the algorithmic expressiveness of logic.
Subtractive logic
  • T. Crolard
  • Philosophy, Computer Science
    Theor. Comput. Sci.
  • 2001
On the Complexity of Linear Authorization Logics
  • Vivek Nigam
  • Computer Science, Mathematics
    2012 27th Annual IEEE Symposium on Logic in Computer Science
  • 2012
This paper investigates the complexity of the provability problem, that is, determining whether a linear authorization logic formula is provable or not, and shows that the multiplicative propositional fragment of LAL is already undecidable in the presence of two principals.
Basic proof theory
N- systems and H-systems and Gentzen systems, proof theory of arithmetic, second-order logic, and solutions to selected exercises.
Computer Science Logic
In the ambient logic of classical second order propositional calculus, we solve the specification problem for a family of excluded middle like tautologies. These are shown to be realized by