Abstract:
Logics with the modal operator “\ldots is true and provable” together with the modal proof operators “p is a proof of \ldots” are axiomatized. Kripke-style completeness, decidability and arithmetical completeness of these logics are established.