Skip to main content
Article thumbnail
Location of Repository

On Kripke-style semantics for the provability logic of Gödel’s proof predicate with quantifiers on proofs

By R. Yavorskiy


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

Topics: Wijsbegeerte
Year: 2005
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.