@conference {1522,
title = {The Logic of the G{\"o}del Proof Predicate},
booktitle = {Computational Logic and Proof Theory, Third Kurt G{\"o}del Colloquium, KGC{\textquoteright}93, Brno, Czech Republic, August 24{\textendash}27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {713},
year = {1993},
pages = {71-82},
publisher = {Springer},
organization = {Springer},
abstract = {We discuss the logics of the operators {\textquoteleft}{\textquoteleft}$p$~is a proof of~$A${\textquoteright}{\textquoteright} and {\textquoteleft}{\textquoteleft}$p$~is a proof containing~$A${\textquoteright}{\textquoteright} for the standard G{\"o}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 {\textquoteleft}{\textquoteleft}$A$~is provable{\textquoteright}{\textquoteright} is studied.},
doi = {10.1007/BFb0022556},
author = {Sergei Artemov and Tyko Strassen},
editor = {Georg Gottlob and Alexander Leitsch and Daniele Mundici}
}