Logic of Proofs with the Strong Provability Operator
Elena Nogina

Abstract:
Logics with the strong provability operator ``... is true and provable'' 
together with the proof operators ``p is a proof of...'' are axiomatized. 
Kripke­style completeness, decidability and arithmetical completeness of 
these logics are established.