%0 Conference Paper
%B Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24–27, 1993, Proceedings
%D 1993
%T The Logic of the Gödel Proof Predicate
%A Sergei Artemov
%A Tyko Strassen
%E Georg Gottlob
%E Alexander Leitsch
%E Daniele Mundici
%X We discuss the logics of the operators ``$p$ is a proof of $A$'' and ``$p$ is a proof containing $A$'' for the standard Gödel proof predicate in Peano Arithmetic. Decidabillty and arithmetical completeness of these logics are proved. We use the same semantics as for the Provability Logic where the operator ``$A$ is provable'' is studied.
%B Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24–27, 1993, Proceedings
%S Lecture Notes in Computer Science
%I Springer
%V 713
%P 71-82
%G eng
%R 10.1007/BFb0022556