On strong provability predicates and the associated modal logics

Journal of Symbolic Logic 58 (1):249-290 (1993)
PA is Peano Arithmetic. Pr(x) is the usual Σ1-formula representing provability in PA. A strong provability predicate is a formula which has the same properties as Pr(·) but is not Σ1. An example: Q is ω-provable if PA + ¬ Q is ω-inconsistent (Boolos [4]). In [5] Dzhaparidze introduced a joint provability logic for iterated ω-provability and obtained its arithmetical completeness. In this paper we prove some further modal properties of Dzhaparidze's logic, e.g., the fixed point property and the Craig interpolation lemma. We also consider other examples of the strong provability predicates and their applications
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275337
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 36,519
Through your library

References found in this work BETA

Omega-Consistency and the Diamond.George Boolos - 1980 - Studia Logica 39 (2-3):237 - 243.

Add more references

Citations of this work BETA

Provability Algebras and Proof-Theoretic Ordinals, I.Lev D. Beklemishev - 2004 - Annals of Pure and Applied Logic 128 (1-3):103-123.
Topological Completeness of the Provability Logic GLP.Lev Beklemishev & David Gabelaia - 2013 - Annals of Pure and Applied Logic 164 (12):1201-1223.
Kripke Semantics for Provability Logic GLP.Lev D. Beklemishev - 2010 - Annals of Pure and Applied Logic 161 (6):756-774.

View all 11 citations / Add more citations

Similar books and articles


Added to PP index

Total downloads
33 ( #197,128 of 2,301,533 )

Recent downloads (6 months)
1 ( #429,404 of 2,301,533 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature