The basic logic of proofs
Propositional Provability Logic was axiomatized in . This logic describes the behaviour of the arithmetical operator “y is provable”. The aim of the current paper is to provide propositional axiomatizations of the predicate “x is a proof of y”by means of modal logic, with the intention of meeting some of the needs of computer science.
- S. Artëmov and T. Straßen, “The Basic Logic of Proofs,” Tech. Rep. IAM 92-018, Department for computer science, University of Berne, Switzerland, September 1992.
- S. Artëmov and T. Straßen, “Functionality in the Basic Logic of Proofs,” Tech. Rep. IAM 93-004, Department for computer science, University of Berne, Switzerland, January 1993.
- G. Boolos, The unprovability of consistency: an essay in modal logic. Cambridge: Cambridge University Press, 1979.
- C. Smoryński, “The incompleteness theorems,” in Handbook of Mathematical Logic (J. Barwise, ed.), ch. D.1, S3, pp. 821–865, North-Holland, Amsterdam, 1977.
- R. M. Solovay, “Provability interpretations of modal logic,” Israel Journal of Mathematics, vol. 25, pp. 287–304, 1976.
- The basic logic of proofs
- Book Title
- Computer Science Logic
- Book Subtitle
- 6th Workshop, CSL '92 San Miniato, Italy, September 28 – October 2, 1992 Selected Papers
- pp 14-28
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.