Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

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

Published: 01 August 2005 Publication History

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.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of Logic and Computation
Journal of Logic and Computation  Volume 15, Issue 4
August 2005
161 pages
ISSN:0955-792X
EISSN:1465-363X
Issue’s Table of Contents

Publisher

Oxford University Press, Inc.

United States

Publication History

Published: 01 August 2005

Author Tags

  1. Kripke semantics
  2. Provability logic
  3. decidability
  4. logic of proofs

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media