TY - CONF
T1 - The Basic Logic of Proofs
T2 - Computer Science Logic, 6th Workshop, CSL'92, San Miniato, Italy, September 28–October 2, 1992, Selected Papers
Y1 - 1993
A1 - Sergei Artemov
A1 - Tyko Strassen
ED - E. Börger
ED - Gerhard Jäger
ED - Kleine Büning, H.
ED - S. Martini
ED - M. M. Richter
AB - 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.
JF - Computer Science Logic, 6th Workshop, CSL'92, San Miniato, Italy, September 28–October 2, 1992, Selected Papers
T3 - Lecture Notes in Computer Science
PB - Springer
VL - 702
ER -