Abstract
The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of inference rules for propositional classical logic in this new framework and prove cut elimination for it. The system enjoys a decomposition theorem for derivations that is not available in the sequent calculus. The main novelty of our system is that all the rules are local: contraction, in particular, is reduced to atomic form. This should be interesting for distributed proof-search and also for complexity theory, since the computational cost of applying each rule is bounded.
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
Kai Brünnler and Alwen Fernanto Tiu. A local system for classical logic. Techni-cal Report WV-2001-02, Dresden University of Technology, 2001. On the web at:http://www.wv.inf.tu-dresden.de/~kai/LocalClassicalLogic.ps.gz.
Gerhard Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The Collected Papers of Gerhard Gentzen, pages 68–131. North-Holland, Amsterdam,1969.
Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
Jean-Yves Girard. Proof Theory and Logical Complexity, Volume I, volume 1 of Studies in Proof Theory. Bibliopolis, Napoli, 1987. Distributed by Elsevier.
Alessio Guglielmi. A calculus of order and interaction. Technical ReportWV-99-04, Dresden University of Technology, 1999. Available on the web at http://www.wv.inf.tu-dresden.de/~guglielm/Research/Gug/Gug.pdf.
Alessio Guglielmi and Lutz Straßburger. Non-commutativity and MELL in the calculus of structures. Technical Report WV-01-04, Dresden University of Technology, 2001. Accepted by the Annual Conference of the European Association for Computer Science Logic, CSL’01.
Lutz Straßburger. MELL in the calculus of structures. Technical Report WV-2001-03, Dresden University of Technology, 2001. On the web at: http://www.ki.inf.tu-dresden.de/~lutz/els.pdf.
Anne Sjerp Troelstra and Helmut Schwichtenberg. Basic Proof Theory. Cambridge University Press, 1996.
W. Bibel. On matrices with connections. Journal of the Association for Computing Machinery, 28(4):633–645, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brünnler, K., Tiu, A.F. (2001). A Local System for Classical Logic. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive