Abstract
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.
