Skip to main content
SpringerLink
Log in

Abstract Interpretation of Proofs: Classical Propositional Calculus

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3210))

Included in the following conference series:

Abstract

Representative abstract interpretations of the proof theory of the classical propositional calculus are described. These provide invariants for proofs in the sequent calculus. The results of calculations in simple cases are given and briefly discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellin, G., Hyland, M., Robinson, E., Urban, C.: Proof Theory of Classical Logic (preparation)

    Google Scholar 

  2. Blackwell, R., Kelly, G.M., Power, A.J.: Two-dimensional monad theory. Journal of Pure and Applied Algebra 59, 1–41 (1989)

    Article  MathSciNet  Google Scholar 

  3. Bloom, S.L., Esik, Z.: Iteration Theories. Springer, Heidelberg (1993)

    Book  Google Scholar 

  4. Carbone, A.: Duplication of directed graphs and exponential blow up of proofs. Annals of Pure and Applied Logic 100, 1–67 (1999)

    Article  MathSciNet  Google Scholar 

  5. Carbone, A.: Asymptotic cyclic expansion and bridge groups of formal proofs. Journal of Algebra, 109–145 (2001)

    Google Scholar 

  6. Carbone, A.: Streams and strings in formal proofs. Theoretical Computer Science 288(1), 45–83 (2002)

    Article  MathSciNet  Google Scholar 

  7. Carmody, S.: Cobordism Categories. PhD Dissertation, University of Cambridge (1995)

    Google Scholar 

  8. Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, Boca Raton (1971)

    MATH  Google Scholar 

  9. Dijkgraaf, R.: A geometric approach to two dimensional conformal field theory. Ph.D. Thesis, Univeristy of Utrecht (1989)

    Google Scholar 

  10. Frobenius, G.: Theorie der hyperkomplexen Grössen. Sitzungsbereich K. Preuss Akad. Wis. 24, 503–537, 634–645 (1903)

    Google Scholar 

  11. Führmann, C., Pym, D.: Order-enriched Categorical Models of the Classical Sequent Calculus (Submitted)

    Google Scholar 

  12. Führmann, C., Pym, D.: On the Geometry of Interaction for Classical Logic (Extended Abstract). In: Proceedings LICS 2004. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  13. Girard, J.-Y.: Proofs and Types. Cambridge University Press, Cambridge (1989)

    MATH  Google Scholar 

  14. Girard, J.-Y.: Linear Logic. Theoretical Computer Science 50, 1–102 (1987)

    Article  MathSciNet  Google Scholar 

  15. Hasegawa, M.: Models of sharing graphs (A categorical semantics for Let and Letrec). In: Distinguished Dissertation in Computer Science, Springer, Heidelberg (1999)

    Google Scholar 

  16. Hyland, J.M.E.: Proof Theory in the Abstract. Annals of Pure and Applied Logic 114, 43–78 (2002)

    Article  MathSciNet  Google Scholar 

  17. Hyland, M., Power, J.: Symmetric monoidal sketches. In: Proceedings of PPDP 2000, pp. 280–288. ACM Press, New York (2000)

    Google Scholar 

  18. Hyland, M., Power, J.: Symmetric monoidal skecthes and categories of wiring diagrams. In: Proceedings of CMCIM (2003, To appear)

    Google Scholar 

  19. Hyland, M., Schalk, A.: Glueing and Orthogonality for Models of Linear Logic. Theoretical Computer Science 294, 183–231 (2003)

    Article  MathSciNet  Google Scholar 

  20. Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc Camb Phil. Soc. 119, 425–446 (1996)

    Article  MathSciNet  Google Scholar 

  21. Kelly, G.M., Laplaza, M.: Coherence for compact closed categories. Journal of Pure and Applied Algebra 19, 193–213 (1980)

    Article  MathSciNet  Google Scholar 

  22. Kelly, G.M., Power, A.J.: Adjunctions whose counits are equalizers, and presentations of finitary enriched monads. Journal of Pure and Applied Algebra 89, 163–179 (1993)

    Article  MathSciNet  Google Scholar 

  23. Kock, J.: Frobenius Algebras and 2D Topological Quantum Field Theories. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  24. Lawvere, F.W.: Ordinal sums and equational doctrines. Seminar on Triples and Categorical Homology Theory, LNM 80, 141–155 (1969)

    Article  MathSciNet  Google Scholar 

  25. Mac Lane, S.: Categories for the working mathematician. In: Graduate Texts in Mathematics, vol. 5. Springer, Heidelberg (1971)

    Google Scholar 

  26. May, J.P.: Simplicial objects in algebraic topology, Van Nostrand, Princeton (1967)

    Google Scholar 

  27. Nygaard, M., Winskel, G.: Domain Theory for Concurrency. Theoretical Computer Science (To appear)

    Google Scholar 

  28. Power, A.J., Robinsons, E.P.: A characterization of PIE limits. Math. Proc. Camb. Phil. Soc. 110, 33–47 (1991)

    Article  MathSciNet  Google Scholar 

  29. Prawitz, D.: Ideas and results in proof theory. In: Fenstad, J.-E. (ed.) Proceedings of the Second Scandinavian Logic Symposium, North-Holland, pp. 237–309 (1971)

    Google Scholar 

  30. Robinson, E.P.: Proof Nets for Classical Logic. Journal of Logic and Computation 13, 777–797 (2003)

    Article  MathSciNet  Google Scholar 

  31. Szabo, M.E.: Polycategories. Comm. Alg. 3, 663–689 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DPMMS, Centre for Mathematical Sciences, University of Cambridge, England

    Martin Hyland

Authors
  1. Martin Hyland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University, Poland

    Jerzy Marcinkowski

  2. Polish Academy of Sciences, Institute of Computer Science, Poland

    Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hyland, M. (2004). Abstract Interpretation of Proofs: Classical Propositional Calculus. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30124-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23024-3

  • Online ISBN: 978-3-540-30124-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation