On strong provability predicates and the associated modal logics
Keyword(s):
AbstractPA 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.
2011 ◽
Vol 158
(8)
◽
pp. 1085-1089
◽
1984 ◽
Vol 48
(2-3)
◽
pp. 275-288
◽
2001 ◽
Vol 64
(3)
◽
pp. 435-444
◽
Keyword(s):
2012 ◽
Vol 2012
(1)
◽
1990 ◽
Vol 71
(2)
◽
pp. 211-223
◽
1989 ◽
Vol 39
(1)
◽
pp. 25-30
◽
Keyword(s):