%0 Generic
%D 1992
%T The Basic Logic of Proofs
%A Sergei Artemov
%A Tyko Strassen
%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.
%I Institut für Informatik und angewandte Mathematik
%G eng
%U https://www.iam.unibe.ch/de/forschung/publikationen/techreports/1992/iam-92-018