Creative Commons Attribution 3.0 Unported license
The possession of a suitable proof-calculus is the starting point for many investigations into a logic, including decidability and complexity, computational interpretations and automated theorem proving. By suitable proof-calculus we mean a calculus whose proofs exhibit some notion of subformula property ("analyticity"). In this talk we describe a method for the algorithmic introduction of analytic sequent-style calculi for a wide range of non-classical logics starting from Hilbert systems. To demonstrate the widespread applicability of this method, we discuss how to use the introduced calculi for proving various results ranging from Curry-Howard isomorphism to new interpretative tools for Indology.
@InProceedings{ciabattoni:LIPIcs.CSL.2016.4,
author = {Ciabattoni, Agata},
title = {{Analytic Calculi for Non-Classical Logics: Theory and Applications}},
booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-022-4},
ISSN = {1868-8969},
year = {2016},
volume = {62},
editor = {Talbot, Jean-Marc and Regnier, Laurent},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.4},
URN = {urn:nbn:de:0030-drops-65440},
doi = {10.4230/LIPIcs.CSL.2016.4},
annote = {Keywords: Proof theory, Fuzzy logic}
}