Abstract
We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut-elimination procedure. This gives us a “Boolean” category, which is not a poset. With the semiring of natural numbers, we obtain a sound semantics for classical logic, in which fewer proofs are identified. Though a “real” sequentialization theorem is missing, these proof nets have a grip on complexity issues. In both cases the cut elimination procedure is closely related to its equivalent in the calculus of structures.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Andrews, P.B.: Refutations by matings. IEEE Transactions on Computers C-25, 801–807 (1976)
Brünnler, K., Tiu, A.F.: A local system for classical logic. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 347–361. Springer, Heidelberg (2001)
Buss, S.R.: The undecidability of k-provability. Annals of Pure and Applied Logic 53, 72–102 (1991)
Carbone, A.: Interpolants, cut elimination and flow graphs for the propositional calculus. Annals of Pure and Applied Logic 83, 249–299 (1997)
Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic 44(1), 36–50 (1979)
Coquand, T.: A semantics of evidence for classical arithmetic. The Journal of Symbolic Logic 60(1), 325–337 (1995)
Danos, V., Joinet, J.-B., Schellinx, H.: A new deconstructive logic: Linear logic. The Journal of Symbolic Logic 62(3), 755–807 (1997)
Došen, K.: Identity of proofs based on normalization and generality. The Bulletin of Symbolic Logic 9, 477–503 (2003)
Došen, K., Petrić, Z.: Proof-Theoretical Coherence. KCL Publications, London (2004)
Führmann, C., Pym, D.: On the geometry of interaction for classical logic (extended abstract). In: LICS 2004, pp. 211–220 (2004)
Führmann, C., Pym, D.: Order-enriched categorical models of the classical sequent calculus (2004)
Girard, J.-Y.: A new constructive logic: Classical logic. Mathematical Structures in Computer Science 1, 255–296 (1991)
Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. In: Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1989)
Guglielmi, A.: A system of interaction and structure (2002), To appear in ACM Transactions on Computational Logic. On the web at, http://www.ki.inf.tu-dresden.de/~guglielm/Research/Gug/Gug.pdf
Guglielmi, A., Straßburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 54–68. Springer, Heidelberg (2001)
Hughes, D., van Glabbeek, R.: Proof nets for unit-free multiplicative-additive linear logic. In: LICS 2003, pp. 1–10 (2003)
Martin, J., Hyland, E.: Abstract interpretation of proofs: Classical propositional calculus. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 6–21. Springer, Heidelberg (2004)
Lamarche, F., Straßburger, L.: Constructing free Boolean categories (2005) (Submitted)
Laurent, O.: Etude de la Polarisation en Logique. PhD thesis, Univ. Aix-Marseille II (2002)
Laurent, O.: Polarized proof-nets and λμ-calculus. Theoretical Computer Science 290(1), 161–188 (2003)
Lane, S.M.: Categories for the Working Mathematician. In: Graduate Texts in Mathematics, vol. 5. Springer, Heidelberg (1971)
Parigot, M.: λμ-calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS(LNAI), vol. 624, pp. 190–201. Springer, Heidelberg (1992)
Retoré, C.: Pomset logic: A non-commutative extension of classical linear logic. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 300–318. Springer, Heidelberg (1997)
Robinson, E.P.: Proof nets for classical logic. Journal of Logic and Computation 13, 777–797 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamarche, F., Straßburger, L. (2005). Naming Proofs in Classical Propositional Logic. In: Urzyczyn, P. (eds) Typed Lambda Calculi and Applications. TLCA 2005. Lecture Notes in Computer Science, vol 3461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11417170_19
Download citation
DOI: https://doi.org/10.1007/11417170_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25593-2
Online ISBN: 978-3-540-32014-2
eBook Packages: Computer ScienceComputer Science (R0)