Proving Structural Properties of Sequent Systems in Rewriting Logic

@inproceedings{Olarte2018ProvingSP,
  title={Proving Structural Properties of Sequent Systems in Rewriting Logic},
  author={Carlos Olarte and Elaine Pimentel and Camilo Rocha},
  booktitle={WRLA@ETAPS},
  year={2018}
}
General and effective methods are required for providing good automation strategies to prove properties of sequent systems. Structural properties such as admissibility, invertibility, and permutability of rules are crucial in proof theory, and they can be used for proving other key properties such as cut-elimination. However, finding proofs for these properties requires inductive reasoning over the provability relation, which is often quite elaborated, exponentially exhaustive, and error prone… 
A Rewriting Logic Approach to Specification, Proof-search, and Meta-proofs in Sequent Systems
TLDR
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
TLDR
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.
Automated Reasoning: 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part II
TLDR
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
TLDR
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.

References

SHOWING 1-10 OF 25 REFERENCES
An extended framework for specifying and reasoning about proof systems
TLDR
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.
A formal framework for specifying sequent calculus proof systems
Deep sequent systems for modal logic
TLDR
A systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5, which stay very close to Gentzen’s sequent calculus.
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
TLDR
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.
Proof Search in Nested Sequent Calculi
TLDR
A notion of focusing for nested sequent calculi for modal logics which brings down the complexity of proof search to that of the corresponding sequent Calculi is proposed, resulting in the first nested sequents for the considered non-normal modallogics.
Quati: An Automated Tool for Proving Permutation Lemmas
TLDR
The tool Quati is described, an automated tool capable of proving a wide range of inference rule permutations for a great number of proof systems and its output is very similar to proof derivation figures one would normally find in a proof theory book.
Conditioned Rewriting Logic as a United Model of Concurrency
Logic Programming with Focusing Proofs in Linear Logic
TLDR
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 Linear Logical Framework
TLDR
The linear type theory LLF is presented as the formal basis for a conservative extension of the LF logical framework and can be given an operational interpretation as a logic programming language under which the representations above can be used for type inference, evaluation and cut-elimination.
Decision Problems for Propositional Linear Logic
...
1
2
3
...