Chapter VII The logic of provability

Studies in Logic and the Foundations of Mathematics

Volumn 137, Issue C, 1998, Pages 475-546

  Japaridze, Giorgi ^a   de Jongh, Dick ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956688250     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(98)80022-0     Document Type: Chapter

References (120)

1. In Russian, English translation in: Amer. Math. Soc. Transl. (2), 135: 39-54, 1987. Artëmov S.N. Arithmetically complete modal theories. Semiotika i Informatika, VINITI, Moscow 14 (1980) 115-133
2. In Russian, English translation in Soviet Math. Dokl. 32 (1985),. Artëmov S.N. Nonarithmeticity of truth predicate logics of provability. Doklady Akademii Nauk SSSR 284 (1985) 403-405
3. In Russian, English translation in: Math. USSR Izvestiya 27(3). Artëmov S.N. On modal logics axiomatizing provability. Izvestiya Akad. Nauk SSSR, ser. mat. 49 (1985) 1123-1154
4. In Russian. Artëmov S.N. Numerically correct logics of provability. Doklady Akademii Nauk SSSR 290 (1986) 1289-1292
5. Artëmov S.N. Logic of proofs. Annals of Pure and Applied Logic 67 (1994) 29-59
6. Artëmov S.N. Operational Modal Logic. Tech. Rep. MSI 95-29 (1995), Cornell University
7. In Russian, English translation in Soviet Math. Dokl. 36 (1987), pp. 478-480. Artëmov S.N., and Japaridze (Dzhaparidze) G.K. On effective predicate logics of provability. Doklady Akademii Nauk SSSR 297 (1987) 521-523
8. Artëmov S.N., and Japaridze (Dzhaparidze) G.K. Finite Kripke models and predicate logics of provability. Journal of Symbolic Logic 55 (1990) 1090-1098
9. Avron A. On modal systems having arithmetical interpretations. Journal of Symbolic Logic 49 (1984) 935-942
10. In Russian, English translation in Math. USSR Izvestiya, 35 (1990) 247-275. Beklemishev L.D. On the classification of propositional provability logics. Izvestiya Akademii Nauk SSSR, ser. mat. D 53 (1989) 915-943
11. In Russian, English translation in Math. Notes 45 (1989). Beklemishev L.D. A provability logic without Craig'sportect interpolation property. Matematicheskie Zametkie 45 (1989) 12-22
12. Beklemishev L.D. Provability logics for natural Turing progressions of arithmetical theories. Studia Logica (1991) 107-128
13. In Russian, English translation in Siberian Math. Journal., 33 (1992). Beklemishev L.D. Independent numerations of theories and recursive progressions. Sibirskii Matematichskii Zhurnal 33 (1992) 22-46
14. Beklemishev L.D. On the complexity of arithmetic applications of modal formulae. Archive for Mathematical Logic 32 (1993) 229-238
15. Beklemishev L.D. Review of de Jongh and Montagna [1988,1989], Carbone and Montagna [1989,1990]. Journal of Symbolic Logic 58 (1993) 715-717
16. Beklemishev L.D. On bimodal logics of provability. Annals of Pure and Applied Logic 68 (1994) 115-160
17. Beklemishev L.D. Bimodal logics for extensions of arithmetical theories. Journal of Symbolic Logic 61 (1996) 91-124
18. 0 +EXP. In: Ursini A., and Aglianò P. (Eds). Logic and Algebra (1996), Marcel Dekker, Inc., New York 317-326
19. Berarducci A. The interpretability logic of Peano arithmetic. Journal of Symbolic Logic 55 (1990) 1059-1089
20. Berarducci A., and Verbrugge R. On the provability logic of bounded arithmetic. Annals of Pure and Applied Logic 61 (1993) 75-93
21. Bernardi C. The uniqueness of the fixed-point in every diagnalizable algebra. Studia Logica 35 (1976) 335-343
22. Boolos G. The Unprovability of Consistency (1979), Cambridge University Press
23. Boolos G. Provability, truth and modal logic. Journal of Philosophic Logic 9 (1981) 1-7
24. Boolos G. Extremely undecidable sentences. Journal of Symbolic Logic 47 (1982) 191-196
25. Boolos G. The analytical completeness of Dzhaparidze's polymodal logics. Annals of Pure and Applied Logic 61 (1993) 95-111
26. Boolos G. The Logic of Provability (1993), Cambridge University Press
27. Boolos G., and Jeffrey R.C. Computability and Logic. 3rd ed. (1989), Cambridge University Press
28. Boolos G., and McGee V. The degree of the set of sentences of predicate provability logic that are true under every interpretation. Journal of Symbolic Logic 52 (1987) 165-171
29. Boolos G., and Sambin G. Provability: the emergence of a mathematical modality. Studia Logica 50 (1991) 1-23
30. Carbone A., and Montagna F. Rosser orderings in bimodal logics. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 35 (1989) 343-358
31. Carbone A., and Montagna F. Much shorter proofs: a bimodal investigation. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36 (1990) 47-66
32. Carlson T. Modal logics with several operators and provability interpretations. Israel Journal of Mathematics 54 (1986) 14-24
33. Chellas B.F. Modal Logic: An Introduction (1980), Cambridge University Press
34. Clote P., and Krajíček J. Arithemetic, Proof Theory and Computational Complexity (1993), Oxford University Press
35. van Dalen D. Logic and Structure (1994), Springer Verlag, Berlin, Amsterdam
36. In Russian. Esakia L.L. Provability logic with quantifier modalities. Intensional Logics and the Logical Structure of Theories: Material from the fourth Soviet-Finnish Symposium on Logic, Telavi. May 20-24, 1985, Metsniereba, Tbilisi (1988) 4-9
37. Feferman S. Arithmetization of metamathematics in a general setting. Archive for Mathematical Logic 6 (1960) 52-63
38. Feferman S. Transfinite recursive progressions of axiomatic theories. Journal of Symbolic Logic 27 (1962) 259-316
39. Feferman S., Kreisel G., and Orey S. 1-consistency and faithful interpretations. Fundamenta Mathematicae 49 (1960) 35-92
40. Gleit Z., and Goldfarb W. Characters and fixed points in provability logic. Notre Dame Journal of Formal Logic 31 (1990) 26-551
41. Gödel K. Eine Interpretation des intuitionistischen Aussagenkalkuls. Ergebnisse Math. Colloq. 4 (1933) 39-40
42. Guaspari D. Partially conservative extensions of arithmetic. Transactions of the American Mathematical Society 254 (1979) 47-68
43. Guaspari D. Sentences implying their own provability. Journal of Symbolic Logic 48 (1983) 777-789
44. Guaspari D., and Solovay R.M. Rosser sentences. Annals of Mathematical Logic 16 (1979) 81-99
45. Hájek P. On interpretability in set theories I. Comm. Math. Univ. Carolinae 12 (1971) 73-79
46. Hájek P. On interpretability in set theories II. Comm. Math. Univ. Carolinae 13 (1972) 445-455
47. 1 -conservativity. Archiv für Mathematische Logik und Grundlagenforschung 30 (1990) 113-123
48. 1 -conservativity continued. Archiv für Mathematische Logik und Grundlagenforschung 32 (1992) 57-63
49. P. Hájek, F. Montagna, and P. Pudlak [1993] Abbreviating proofs using metamathematical rules, in: Clote and Krajíček [1993], pp. 387-428.
50. Harel D. Dynamic logic. In: Gabbay D., and Guenthener F. (Eds). Handbook of Philosophic Logic, Volume II, Extensions of Classical Logic (1984), Kluwer Academic Publishers, Dordrecht, Boston 497-604
51. Hilbert D., and Bernays P. Grundlagen der Mathematik II (1939), Springer, Berlin
52. Hughes G.E., and Cresswell M.J. A Companion to MODAL LOGIC (1984), Methuen, London, New York
53. 1 -interpolability over Peano arithmetic (1990)
54. Ignatiev K.N. On strong provability predicates and the associated modal logics. Journal of Symbolic Logic 58 (1993) 249-290
55. 1 -interpolability. Annals of Pure and Applied Logic 64 (1993) 1-25
56. In Russian. Japaridze (Dzhaparidze) G.K. The Modal Logical Means of Investigation of Provability. PhD thesis (1986), Moscow State University
57. In Russian. Japaridze (Dzhaparidze) G.K. The arithmetical completeness of the logic of provability with quantifier modalities. Bull. Acad. Sci. Georgian SSR 132 (1988) 265-268
58. In Russian. The polymodal logic of provability. Intensional Logics and the Logical Structure of Theories: Material from the fourth Soviet-Finnish Symposium on Logic. Telavi, May 20-24, 1985, Metsniereba, Tbilisi (1988) 16-48
59. Japaridze (Dzhaparidze) G.K. Decidable and enumerable predicate logics of provability. Studia Logica 49 (1990) 7-21
60. Japaridze (Dzhaparidze) G.K. Provability logic with modalities for arithmetical complexities. Bull. Acad. Sci. Georgian SSR 138 (1990) 481-484
61. Japaridze (Dzhaparidze) G.K. Predicate provability logic with non-modalized quantifiers. Studia Logica 50 (1991) 149-160
62. Japaridze (Dzhaparidze) G.K. The logic of linear tolerance. Studia Logica 51 (1992) 249-277
63. Japaridze (Dzhaparidze) G.K. A generalized notion of weak interpretability and the corresponding logic. Annals of Pure and Applied Logic 61 (1993) 113-160
64. Japaridze (Dzhaparidze) G.K. The logic of arithmetical hierarchy. Annals of Pure and Applied Logic 66 (1994) 89-112
65. 1 -conservativity logic. Notre Dame Journal of Formal Logic 35 (1994) 346-354
66. Jongh D.H.J.d. A simplification of a completeness proof of Guaspari and Solovay. Studia Logica 46 (1987) 187-192
67. Jongh D.H.J.d., Jumelet M., and Montagna F. On the proof of Solovay's theorem. Studia Logica 50 (1991) 51-70
68. Jongh D.H.J.d., and Montagna F. Provable fixed points. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 34 (1988) 229-250
69. Jough D.H.J.d., and Montagna F. Much shorter proofs. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 35 (1989) 247-260
70. Jongh D.H.J.d., and Montagna F. Rosser-orderings and free variables. Studia Logica 50 (1991) 71-80
71. To appear. Jongh D.H.J.d., and Pianigiani D. Solution of a problem of David Guaspari. Studia Logica 57 (1998)
72. D. H. J. de Jongh and F. Veltman [1990] Provability logics for relative interpretability, in: Petkov [1990], pp. 31-42.
73. Jongh D.H.J.d., and Visser A. Explicit fixed points in interpretability logic. Studia Logica 50 (1991) 39-50
74. Kreisel G., and Lévy A. Reflection principles and their use for establishing the complexity of axiomatic systems. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 14 (1968) 97-142
75. Lindström P. On faithful interpretability. In: Richter M.M., Börger E., Oberschelp W., Schinzel B., and Thomas W. (Eds). Computation and Proof Theory. Lecture Notes in Mathematics #1104 (1984), Springer Verlag, Berlin, Berlin 279-288
76. Lindström P. The Modal Logic of Parikh Provability. Tech. Rep. Filosofiska Meddelanden, Gröna serien No. 5 (1994), University of Göteborg
77. McKinsey J.C.C., and Tarski A. Some theorems about the calculi of Lewis and Heyting. Journal of Symbolic Logic 13 (1948) 1-15
78. Montagna F. On the diagonalizable algebra of Peano arithmetic. Bulletino della Unione Matematica Italiana 5 16B (1979) 795-812
79. Montagna F. The predicate modal logic of provability. Notre Dame Journal of Formal Logic 25 (1984) 179-189
80. Montagna F. Provability in finite subtheories of PA. Journal of Symbolic Logic 52 (1987) 494-511
81. Montagna F. Polynomially and superexponentially shorter proofs in fragments of arithmetic. Journal of Symbolic Logic 57 (1992) 844-863
82. Orey S. Relative interpretations. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 7 (1961) 146-153
83. Parikh R. Existence and feasibility. Journal of Symbolic Logic 36 (1971) 494-508
84. In: P.P. P. (Ed). Mathematical Logic, Proceedings of the Heyting 1988 Summer School (1990), Plenum Press, New York
85. Rijke M.d. Unary interpretability logic. Notre Dame Journal of Formal Logic 33 (1992) 249-272
86. Sambin G. An effective fixed-point theorem in intuitionistic diagonalizable algebras. Studia Logica 35 (1976) 345-361
87. Sambin G., and Valentini S. The modal logic of provability. The sequential approach. Journal of Philosophical Logic 11 (1982) 311-342
88. Sambin G., and Valentini S. The modal logic of provability: cut elimination. Journal of Philosophical Logic 12 (1983) 471-476
89. Scott D.S. Algebras of sets binumerable in complete extensions of arithmetic. Recursive Function Theory (1962), American Mathematical Society, Providence, R.I. 117-121
90. (in Russian). Shavrukov V.Y. The Logic of Relative Interpretability over Peano Arithmetic. Tech. Rep. Report No. 5 (1988), Stekhlov Mathematical Institute, Moscow
91. Shavrukov V.Y. On Rosser's provability predicate. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 37 (1991) 317-330
92. Shavrukov V.Y. A note on the diagonalizable algebras of PA and ZF. Annals of Pure and Applied Logic 61 (1993) 161-173
93. Shavrukov V.Y. Subalgebras of diagonalizable algebras of theories containing arithmetic. Dissertationes mathematicae (Rozprawy matematycne) 323 (1993), Instytut Matematyczny, Polska Akademia Nauk, Warsaw
94. Shavrukov V.Y. A smart child of Peano's. Notre Dame Journal of Formal Logic 35 (1994) 161-185
95. Shavrukov V.Y. Undecidability in diagonalizable algebras. Journal of Symbolic Logic 62 (1997) 79-116
96. Smoryński C. The incompleteness theorems. In: Barwise J. (Ed). Handbook of Mathematical Logic vol. 4 (1977), North-Holland, Amsterdam, Amsterdam 821-865
97. Smoryński C. Beth's theorem and self-referential statements. In: Macintyre A., Pacholski L., and Paris J.B. (Eds). Computation and Proof Theory (1978), North-Holland, Amsterdam, Amsterdam 17-36
98. Smoryński C. Self-reference and modal logic (1985), Springer-Verlag, Berlin
99. Solovay R.M. Provability interpretations of modal logic. Israel Journal of Mathematics 25 (1976) 287-304
100. Acta Philosophica Gothoburgensia 5. Strannegrd C. Arithmetical Realizations of Modal Formulas. PhD thesis (1997), University of Göteborg
101. Tarski A., Mostowski A., and Robinson R.M. Undecidable Theories (1953), North-Holland, Amsterdam, Amsterdam
102. Troelstra A.S., and Schwichtenberg H. Basic Proof Theory (1996), Cambridge University Press
103. Turing A. System of logics based on ordinals. Proceedings of the London Mathematical Society, Ser. 2 45 (1939) 161-228
104. In Russian, English translation in Soviet Math. Dokl. 33 (1986), pp. 569-572. Vardanyan V.A. Arithmetic complexity of predicate logics of provability and their fragments. Doklady Akademii Nauk SSSR 288 (1986) 11-14
105. ILLC-disseration series 1993-3. Verbrugge R. Efficient Metamathematics. PhD thesis (1993), Universiteit van Amsterdam
106. Feasible interpretability, in: clote and Krajíček [1993], pp. 197-221.
107. Visser A. Numerations, Λ-calculus and arithmetic. In: Seldin J.P., and Hindley J.R. (Eds). To H.B. Curry: Essays on Combinatory logic, lambda calculus and formalism (1980), Academic Press, Inc., London 259-284
108. Visser A. Aspects of Diagonalization and Provability. PhD thesis (1981), University of Utrecht, Utrecht, The Netherlands
109. Visser A. The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic. Journal of Philosophical Logic 13 (1984) 97-113
110. Visser A. Evaluation, Provably Deductive Equivalence in Heyting's arithmetic of Substitution Instances of Propositional Formulas. Tech. Rep. LGPS 4 (1985), Department of Philosophy, Utrecht University
111. Visser A. Peano's smart children. a provability logical study of systems with built-in consistency. Notre Dame Journal of Formal Logic 30 (1989) 161-196
112. Interpretability logic, in: Petkov [1990], pp. 175-209
113. Visser A. The formalization of interpretability. Studia Logica 50 (1991) 81-106
114. To appear in the Annals of Pure and Applied Logic. Visser A. Propositional Combinations of Σ-Sentences in Heyting's Arithmetic. Tech. Rep. LGPS 117 (1994), Department of Philosophy, Utrecht University
115. Visser A. A course in bimodal provability logic. Annals of Pure and Applied Logic 73 (1995) 109-142
116. Visser A. An overview of interpretability logic. In: Kracht M., Rijke M.d., and Wansing H. (Eds). Advances in Modal Logic '96 (1997), CSLI Publications, Stanford
117. Visser A., van Benthem J., Jongh D.H.J.d., and Renardel de Lavalette G.R. NILL, a study in intuitionistic propositional logic. In: Ponse A., Rijke M.d., and Venema Y. (Eds). Modal Logic and Process Algebra, a Bisimulation Perspective. CSLI Lecture Notes #53 (1995), CSLI Publications, Stanford 289-326
118. Voorbraak F. A simplification of the completeness proofs for Guaspari and Solovay's R. Notre Dame Journal of Formal Logic 31 (1988) 44-63
119. Zambella D. On the proofs of arithmetical completeness of interpretability logic. Notre Dame Journal of Formal Logic 35 (1992) 542-551
120. 0 +EXP. Notre Dame Journal of Formal Logic 35 (1994) 147-157