Skip to main content
Log in

An Operational Logic of Proofs with Positive and Negative Information

  • Published:
Studia Logica Aims and scope Submit manuscript

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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. S. Artemov, ‘Logics of Proofs’, Annals of Pure and Applied Logic 67 (1992), 25–59.

    Google Scholar 

  3. S. Artemov, Dynamic Logic of Proofs, Extended Abstract, Amsterdam 1994.

    Google Scholar 

  4. G. Boolos, The Unprovability of Consistency. An Essay in Modal Logic, Cambridge University Press 1979.

  5. G. Boolos, The Logic of Provability, Cambridge Press, Cambridge 1993.

    Google Scholar 

  6. S. Buss, ‘The undecidability of k-provability’, Annals of Pure and Applied Logic 53 (1991), 72–102.

    Google Scholar 

  7. S. Feferman, ‘Arithmetization of metamathematics in a general setting’, Fundamenta Mathematicae 1960, 35–95.

  8. 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. R. J. Parikh, ‘Some results on the length of proofs’, Transactions of the American Mathematical Society 177 (1973), 29–36.

    Google Scholar 

  10. C. SmoryŃski, Self Reference and Modal Logic, Springer Varlag, New York, Berlin, Heidelberg, Tokyo 1985.

    Google Scholar 

  11. R. Solovay, ‘Provability interpretations of modal logic’, Israel Journal of Mathematics 25 (1976), 357–374.

    Google Scholar 

  12. G. Takeuti, Proof Theory, North Holland, Amsterdam 1980.

    Google Scholar 

  13. V. Vardanjan, ‘Arithmetical complexity of predicate logics of provability and their fragments’, Doklady Akademii Nauk SSRR 288 (1986), 11–14.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luchi, D., Montagna, F. An Operational Logic of Proofs with Positive and Negative Information. Studia Logica 63, 7–25 (1999). https://doi.org/10.1023/A:1005298816666

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005298816666

Navigation