@conference {1519,
title = {The Basic Logic of Proofs},
booktitle = {Computer Science Logic, 6th Workshop, CSL{\textquoteright}92, San Miniato, Italy, September 28{\textendash}October 2, 1992, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {702},
year = {1993},
pages = {14-28},
publisher = {Springer},
organization = {Springer},
abstract = {Propositional Provability Logic was axiomatized in~[Sol76]. This logic describes the behaviour of the arithmetical operator {\textquoteleft}{\textquoteleft}$y$~is provable{\textquoteright}{\textquoteright}. The aim of the current paper is to provide propositional axiomatizations of the predicate {\textquoteleft}{\textquoteleft}$x$~is a proof of~$y${\textquoteright}{\textquoteright} by means of modal logic, with the intention of meeting some of the needs of computer science.},
doi = {10.1007/3-540-56992-8_3},
author = {Sergei Artemov and Tyko Strassen},
editor = {E. B{\"o}rger and Gerhard J{\"a}ger and Kleine B{\"u}ning, H. and S. Martini and M. M. Richter}
}