The basic logic of proofs

  • Sergei Artëmov
  • Tyko Straßen
Conference paper

DOI: 10.1007/3-540-56992-8_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 702)
Cite this paper as:
Artëmov S., Straßen T. (1993) The basic logic of proofs. In: Börger E., Jäger G., Kleine Büning H., Martini S., Richter M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg


Propositional Provability Logic was axiomatized in [5]. 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Sergei Artëmov
    • 1
  • Tyko Straßen
    • 2
  1. 1.Steklov Mathematical InstituteMoscowRussia
  2. 2.University of Berne, IAMBerne

Personalised recommendations