Abstract
We give a calculus of proof-nets for classical propositional logic. These nets improve on a proposal due to Robinson by validating the associativity and commutativity of contraction, and provide canonical representants for classical sequent proofs modulo natural equivalences. We present the relationship between sequent proofs and proof-nets as an annotated sequent calculus, deriving formulae decorated with expansion/deletion trees. We then show a subcalculus, expansion nets, which in addition to these good properties has a polynomial-time correctness criterion.
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
Bellin, G.: Two paradigms of logical computation in affine logic? In: Logic for concurrency and synchronisation, pp. 111–144 (2003)
Bellin, G., Hyland, M., Robinson, E., Urban, C.: Categorical proof theory of classical propositional calculus. Theor. Comput. Sci. 364(2), 146–165 (2006)
Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Logic 44(1), 36–50 (1979)
Danos, V., Di Cosmo, R.: The linear logic primer. lecture notes, http://www.dicosmo.org/CourseNotes/LinLog/
Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic 28, 181–203 (1989)
Danos, V.: La Logique Linéaire Appliquée l’étude de Divers Processus de Normalisation. PhD thesis, University of Paris VII (1990)
Führmann, C., Pym, D.: Order-enriched categorical models of the classical sequent calculus. Journal of Pure and Applied Algebra 204(1), 21–78 (2006)
Girard, J.-Y.: A new constructive logic: Classical logic. Mathematical Structures in Computer Science 1(3), 255–296 (1991)
Girard, J.-Y.: Proof-nets: The parallel syntax for proof-theory. In: Logic and Algebra, pp. 97–124. Marcel Dekker, New York (1996)
Hughes, D.J.D.: Towards Hilbert’s 24th problem: Combinatorial proof invariants. Electron. Notes Theor. Comput. Sci. 165, 37–63 (2006)
Hughes, D.J.D.: Proofs Without Syntax. Annals of Mathematics 143(3), 1065–1076 (2006)
Lamarche, F., Strassburger, L.: Naming proofs in classical logic. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 246–261. Springer, Heidelberg (2005)
Lamarche, F., Strassburger, L.: Constructing free boolean categories. In: LICS 2005: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, pp. 209–218. IEEE Computer Society, Los Alamitos (2005)
McKinley, R.: Proof nets for Herbrand’s theorem (Preprint), http://arxiv.org/abs/1005.3986v1
Miller, D.: A compact representation of proofs. Studia Logica 46(4), 347–370 (1987)
Robinson, E.: Proof nets for classical logic. Journal of Logic and Computation 13(5), 777–797 (2003)
Trimble, T.H.: Linear logic, bimodules, and full coherence for autonomous categories. PhD thesis, Rutgers University (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McKinley, R. (2010). Expansion Nets: Proof-Nets for Propositional Classical Logic. In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-16242-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16241-1
Online ISBN: 978-3-642-16242-8
eBook Packages: Computer ScienceComputer Science (R0)