An extended framework for specifying and reasoning about proof systems

@article{Nigam2016AnEF,
  title={An extended framework for specifying and reasoning about proof systems},
  author={Vivek Nigam and Elaine Pimentel and Giselle Reis},
  journal={J. Log. Comput.},
  year={2016},
  volume={26},
  pages={539-576}
}
It has been shown that linear logic can be successfully used as a framework for both specifying proof systems for a number of logics, as well as proving fundamental properties about the specified 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… 

Figures from this paper

Proving Structural Properties of Sequent Systems in Rewriting Logic
TLDR
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
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.
A focused linear logical framework and its application to metatheory of object logics
TLDR
This paper formalizes the proof of cut-elimination for focused LL, and proposes a framework that can be used to formalize fundamental properties of logical systems specified as LL theories.
Theorem Provers For Every Normal Modal Logic
TLDR
A procedure for algorithmically embedding problems formulated in higherorder modal logic into classical higher-order logic, and can be used as a preprocessor for turning TPTP THF-compliant theorem provers into provers for various modal logics.
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.
A framework for linear authorization logics
  • Vivek Nigam
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2014
A uniform framework for substructural logics with modalities
TLDR
This work investigates a local system for linear logic (LL) based on linear nested sequents (LNS) and proposes a general framework for modularly describing systems combining, coherently, substructural behaviors inherited from LL and simply dependent multimodalities.
Tools for the Investigation of Substructural , Intermediate and Paraconsistent Logics
TLDR
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.
A Logical Framework with Commutative and Non-commutative Subexponentials
TLDR
This work proposes a linear logical framework containing both commutative and non-commutative subexponentials and investigates the proof theory of formulas that can only contract, but not weaken, and demonstrates that under some conditions such formulas may be treated as unbounded formulas, which behave intuitionistically.
...
...

References

SHOWING 1-10 OF 43 REFERENCES
A Framework for Proof Systems
TLDR
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.
A formal framework for specifying sequent calculus proof systems
On the Specification of Sequent Systems
TLDR
This paper introduces Llinda, a logical framework based on linear logic augmented with inference rules for definition (fixed points) and induction, and extends the definition of coherence and provides a new, semi-automated proof of cut-elimination for Girard’s Logic of Unicity (LU).
Specifying Proof Systems in Linear Logic with Subexponentials
Using Linear Logic to Reason about Sequent Systems
Linear logic can be used as a meta-logic for the specification of some sequent calculus proof systems. We explore in this paper properties of such linear logic specifications. We show that
Exploiting non-canonicity in the sequent calculus
TLDR
This thesis provides a proof theoretic explanation for tabled deduction by exploiting the fact that in intuitionistic logic atoms can be assigned arbitrary polarity, and shows that linear logic can be used as a general framework for encoding proof systems for minimal, intuitionistic, and classical logics.
A Systematic Proof Theory for Several Modal Logics
TLDR
This paper introduces a systematic presentation for the systems K, D, M, S4, and S5 in the calculus of structures, a structural proof theory that employs deep inference and axiomatise the modal logics in a manner directly analogous to the Hilbert-Lewis axioms.
Checking Proof Transformations with ASP
TLDR
The means to automatize the check of proof transformations by using Answer Set Prog ramming (ASP) are outlined.
Propositional Lax Logic
TLDR
This paper investigates a peculiar intuitionistic modal logic, called Propositional Lax Logic (PLL), which has promising applications to the formal verification of computer hardware, and investigates some of its proof-theoretic properties and defines a new class of fallible two-frame Kripke models for PLL.
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.
...
...