The logic of the Gödel proof predicate
- Cite this paper as:
- Artëmov S., Straßen T. (1993) The logic of the Gödel proof predicate. In: Gottlob G., Leitsch A., Mundici D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg
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. Decidability 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.
Unable to display preview. Download preview PDF.