%0 Conference Paper
%B Computer Science Logic, 6th Workshop, CSL'92, San Miniato, Italy, September 28–October 2, 1992, Selected Papers
%D 1993
%T The Basic Logic of Proofs
%A Sergei Artemov
%A Tyko Strassen
%E E. Börger
%E Gerhard Jäger
%E Kleine Büning, H.
%E S. Martini
%E M. M. Richter
%X Propositional Provability Logic was axiomatized in [Sol76]. 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.
%B Computer Science Logic, 6th Workshop, CSL'92, San Miniato, Italy, September 28–October 2, 1992, Selected Papers
%S Lecture Notes in Computer Science
%I Springer
%V 702
%P 14-28
%G eng
%R 10.1007/3-540-56992-8_3