On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs


Kripke-style semantics is suggested for the provability logic with quantifiers on proofs corresponding to the standard Gödel proof predicate. It is proved that the set of valid formulas is decidable. The arithmetical completeness is still an open issue. 
DOI: 10.1093/logcom/exi037


  • Presentations referencing similar topics