Studia Logica

, Volume 63, Issue 1, pp 7–25 | Cite as

An Operational Logic of Proofs with Positive and Negative Information

  • Duccio Luchi
  • Franco Montagna
Article

Abstract

The logic of proofs was introduced by Artemov in order to analize the formalization of the concept of proof rather than the concept of provability. In this context, some operations on proofs play a very important role. In this paper, we investigate some very natural operations, paying attention not only to positive information, but also to negative information (i.e. information saying that something cannot be a proof). We give a formalization for a fragment of such a logic of proofs, and we prove that our fragment is complete and decidable.

provability logic logic of proofs proof theory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ArtStr]
    S. Artemov, T. Styrassen, ‘The basic Logic of Proofs’, Computer Science and Logic, 6th Workshop CSL 92, San Miniato, Italy, Lecture Notes in Computer Science 702, Springer Verlag Berlin, Heidelberg, New York 1993, pp. 14–28.Google Scholar
  2. [Art]
    S. Artemov, ‘Logics of Proofs’, Annals of Pure and Applied Logic 67 (1992), 25–59.Google Scholar
  3. [Art1]
    S. Artemov, Dynamic Logic of Proofs, Extended Abstract, Amsterdam 1994.Google Scholar
  4. [Boo]
    G. Boolos, The Unprovability of Consistency. An Essay in Modal Logic, Cambridge University Press 1979.Google Scholar
  5. [Boo2]
    G. Boolos, The Logic of Provability, Cambridge Press, Cambridge 1993.Google Scholar
  6. [Bu]
    S. Buss, ‘The undecidability of k-provability’, Annals of Pure and Applied Logic 53 (1991), 72–102.Google Scholar
  7. [Fe]
    S. Feferman, ‘Arithmetization of metamathematics in a general setting’, Fundamenta Mathematicae 1960, 35–95.Google Scholar
  8. [KP]
    J. Krajicek, P. Pudlak, ‘The number of proof lines and the size of proofs in first order logic’, Archive for Mathematical Logic 27 (1988), 69–84.Google Scholar
  9. [Pa]
    R. J. Parikh, ‘Some results on the length of proofs’, Transactions of the American Mathematical Society 177 (1973), 29–36.Google Scholar
  10. [Smo]
    C. SmoryŃski, Self Reference and Modal Logic, Springer Varlag, New York, Berlin, Heidelberg, Tokyo 1985.Google Scholar
  11. [So]
    R. Solovay, ‘Provability interpretations of modal logic’, Israel Journal of Mathematics 25 (1976), 357–374.Google Scholar
  12. [Ta]
    G. Takeuti, Proof Theory, North Holland, Amsterdam 1980.Google Scholar
  13. [Var]
    V. Vardanjan, ‘Arithmetical complexity of predicate logics of provability and their fragments’, Doklady Akademii Nauk SSRR 288 (1986), 11–14.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Duccio Luchi
    • 1
  • Franco Montagna
    • 1
  1. 1.Dipartimento di MatematicaUniversity di SienaSienaItaly

Personalised recommendations