Reflection principles and provability algebras in formal arithmetic

Russian Mathematical Surveys

Volumn 60, Issue 2, 2005, Pages 197-268

  Beklemishev, L D ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23944494659     PISSN: 00360279     EISSN: 14684829     Source Type: Journal    
DOI: 10.1070/RM2005v060n02ABEH000823     Document Type: Article

References (98)

1. Yu. L. Ershov, Theory of numerations, Nauka, Moscow 1977. (Russian)
2. V. P. Orevkov, "Lower bounds for lengthening complexity of deductions after cut-elimination", Zap. Nauchn. Sem. Leningrad. Otdel Mat. Inst. Steklov (LOMI) 88 (1979), 137-162;
3. English transl., J. Soviet Math. 20 (1982), 2337-2350.
4. S. N. Artemov, "Extension of arithmetics and modal logic", Candidate (PhD) dissertation, Steklov Inst. Math., Moscow 1979. (Russian)
5. S. N. Artemov, "Applications of modal logic in proof theory", Problems of Cybernetics: Non-Classical Logics and their Applications, Nauka, Moscow 1982, pp. 3-20. (Russian)
6. S. V. Goryachev, "On the interpretability of some extensions of arithmetic", Mat. Zametki 40 (1986), 561-571;
7. English transl., Math. Notes 40 (1986), 821-827.
8. G. K. Japaridze, "Modal logic tools of investigation of provability", Candidate (PhD) dissertation, Moscow State Univ., Moscow 1986. (Russian)
9. G. K. Japaridze, "The polymodal logic of provability", Intensional Logics and Logical Structure of Theories (Proc. 4th Soviet-Finnish Symposium on Logic, Telavi, 1985) (V. A. Smirnov and M. N. Bezhanishvili, eds.), Metsniereba, Tbilisi 1988, pp. 16-48. (Russian)
10. L. D. Beklemishev, "On a restricted induction rule and iterated reflection principles over Kalmar elementary arithmetic", Theoretical and Applied Problems of Mathematical Research (O. B. Lupanov, ed.), Moscow State Univ., Moscow 1994, pp. 36-39. (Russian)
11. S. S. Goncharov, Countable Boolean algebras and decidability, Nauchnaya Kniga, Novosibirsk 1996; English transl., Plenum Press, New York 1997.
12. W. Ackermann, "Zur Widerspruchsfreiheit der Zahlentheorie", Math. Ann. 117 (1940), 162-194.
13. T. Arai, "Epsilon substitution method for theories of jump hierarchies", Arch. Math. Logic 41 (2002), 123-153.
14. 0)", Ann. Pure Appl. Logic 121 (2003), 163-208.
15. S. N. Artemov and L. D. Beklemishev, "On propositional quantifiers in provability logic", Notre Dame J. Formal Logic 34 (1993), 401-419.
16. S. N. Artemov and L. D. Beklemishev, "Provability logic", Handbook of Philosophical Logic (D. Gabbay and F. Guenthner, eds.), vol. 13, Kluwer, Dordrecht 2004, pp. 229-403.
17. J. Avigad, "An ordinal analysis of admissible set theory using recursion on ordinal notations", J. Math. Logic 2:1 (2002), 91-112.
18. J. Avigad and R. Sommer, "A model-theoretic approach to ordinal analysis", Bull. Symbolic Logic 3 (1997), 17-52.
19. J. Avigad and R. Sommer, "The model-theoretic ordinal analysis of theories of predicative strength", J. Symbolic Logic 64 (1999), 327-349.
20. L. D. Beklemishev, "Iterated local reflection versus iterated consistency", Ann. Pure Appl. Logic 75 (1995), 25-48.
21. 0 + EXP", Lecture Notes in Pure and Appl. Math. 180 (1996), 317-325.
22. L. D. Beklemishev, "Induction rules, reflection principles, and provably recursive functions", Ann. Pure Appl. Logic 85 (1997), 193-242.
23. L. D. Beklemishev, "Notes on local reflection principles", Theoria 63 (1997), 139-146.
24. L. D. Beklemishev, "Parameter free induction and reflection", Lecture Notes in Comput. Sci. 1289 (1997), 103-113.
25. L. D. Beklemishev, "A proof-theoretic analysis of collection", Arch. Math. Logic 37 (1998), 275-296.
26. L. D. Beklemishev, "Parameter free induction and provably total computable functions", Theoret. Comput. Sci. 224:1-2 (1999), 13-33.
27. L. D. Beklemishev, "Proof-theoretic analysis by iterated reflection", Arch. Math. Logic 42 (2003), 515-552.
28. L. D. Beklemishev, "Provability algebras and proof-theoretic ordinals. I", Ann. Pure Appl. Logic 128 (2004), 103-123.
29. L. D. Beklemishev, "The Worm principle", Logic Group Preprint Ser. vol. 219, Utrecht Univ., Utrecht 2003; http://preprints.phil.uu.nl/lgps/.
30. G. Boolos, "Reflection principles and iterated consistency assertions", J. Symbolic Logic 44 (1979), 33-35.
31. G. Boolos, The unprovability of consistency: An essay in modal logic, Cambridge Univ. Press, Cambridge 1979.
32. G. Boolos, "Omega-consistency and the diamond", Studia Logica 39 (1980), 237-243.
33. G. Boolos, The logic of provability, Cambridge Univ. Press, Cambridge 1993.
34. W. Buchholz, "Explaining Gentzen's consistency proof within infinitary proof theory", Lecture Notes in Comput. Sci. 1289 (1997), 4-17.
35. W. Buchholz, "Explaining the Gentzen-Takeuti reduction steps: A second-order system", Arch. Math. Logic 40 (2001), 255-272.
36. W. Buchholz and S. Wainer, "Provably computable functions and the fast growing hierarchy", Contemp. Math. 65 (1987), 179-198.
37. N. Cutland, Computability. An introduction to recursive function theory, Cambridge Univ. Press, Cambridge 1980; Russian translation (edited and with a preface by S. Yu. Maslov), Mir, Moscow 1983.
38. G. Japaridze and D. de Jongh, "The logic of provability", Stud. Logic Found. Math. 137 (1998), 475-546.
39. S. Feferman, "Arithmetization of metamathematics in a general setting", Fund. Math. 49 (1960), 35-92.
40. S. Feferman, "Transfinite recursive progressions of axiomatic theories", J. Symbolic Logic 27 (1962), 259-316.
41. S. Feferman, "Three conceptual problems that bug me", Lecture text for 7th Scandinavian Logic Symposium (Uppsala, 1996); ftp://math.stanford. edu/pub/papers/feferman/; http://math.stanford.edu/~feferman.
42. G. Gentzen, "Die Widerspruchsfreiheit der reinen Zahlentheorie", Math. Ann. 112 (1936), 493-565.
43. G. Gentzen, "Neue Fassung des Widerspruchsfreiheitsbeweises für die reine Zahlentheorie", Forsch. Logik Grundlegung Exakt. Wiss. 4 (1938), 19-44.
44. K. Gödel, "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I", Monatsh. Math. Phys. 38 (1931), 173-198.
45. P. Hájek and P. Pudlák, Metamathematics of first-order arithmetic, Springer-Verlag, Berlin 1993.
46. L. Henkin, J. D. Monk, and A. Tarski, Cylindric algebras, Parts I, II, (Stud. Logic Found. Math., vols. 64, 115) North-Holland, Amsterdam 1985.
47. K. N. Ignatiev, "On strong provability predicates and the associated modal logics", J. Symbolic Logic 58 (1993), 249-290.
48. R. Kaye, J. Paris, and C. Dimitracopoulos, "On parameter free induction schemas", J. Symbolic Logic 53 (1988), 1082-1097.
49. L. A. S. Kirby and J. B. Paris, "Accessible independence results for Peano arithmetic", Bull. London Math. Soc. 14 (1982), 285-293.
50. G. Kreisel, "On the interpretation of non-finitist proofs. II: Interpretation of number theory. Applications", J. Symbolic Logic 17 (1952), 43-58.
51. G. Kreisel, "A survey of proof theory", J. Symbolic Logic 33 (1968), 321-388.
52. G. Kreisel, "Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt", Jahresber. Deutsch. Math.- Verein. 78:4 (1976/1977), 177-223.
53. G. Kreisel and A. Lev́y, "Reflection principles and their use for establishing the complexity of axiomatic systems", Z. Math. Logik Grundlagen Math. 14 (1968), 97-142.
54. D. Leivant, "The optimality of induction as an axiomatization of arithmetic", J. Symbolic Logic 48 (1983), 182-184.
55. P. Lindström, "On partially conservative sentences and interpretability", Proc. Amer. Math. Soc. 91 (1984), 436-443.
56. P. Lindström, "Provability logic - a short introduction", Theoria 62 (1996), 19-61.
57. M. H. Löb, "Solution of a problem of Leon Henkin", J. Symbolic Logic 20 (1955), 115-118.
58. R. Magari, "The diagonalizable algebras", Boll. Unione Mat. Ital (4) 12:3 (1975), 117-125.
59. R. Magari, "Representation and duality theory for diagonalizable algebras", Studia Logica 34 (1975), 305-313.
60. 1 -comprehension rule", Synthese Lib. 280 (1999), 107-130.
61. G. E. Mints, "Quantifier-free and one-quantifier systems", Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov (LOMI) 20 (1971), 115-133;
62. English transl., J. Soviet Math. 1 (1973), 71-84.
63. F. Montagna, "On the algebraization of a Feferman's predicate", Studia Logica 37 (1978), 221-236.
64. F. Montagna, "On the diagonalizable algebra of Peano arithmetic", Boll. Unione Mat. Ital. B (5) 16 (1979), 795-812.
65. F. Montagna, "The undecidability of the first-order theory of diagonalizable algebras in Peano arithmetic", Studia Logica 39 (1980), 347-354.
66. H. Ono, "Reflection principles in fragments of Peano arithmetic", Z. Math. Logik Grundlagen Math. 33 (1987), 317-333.
67. R. Parikh, "Existence and feasibility in arithmetic", J. Symbolic Logic 36 (1971), 494-508.
68. C. Parsons, "On a number-theoretic choice schema and its relation to induction", Intuitionism and Proof Theory (Buffalo, 1968) (A. Kino, J. Myhill, and R. E. Vessley, eds.), North-Holland, Amsterdam 1970, pp. 459-473.
69. C. Parsons, "On n-quantifier induction", J. Symbolic Logic 37 (1972), 466-482.
70. W. Pohlers, "A short course in ordinal analysis", Proof Theory. Papers from International Summer School and Conference on Proof Theory (Leeds, 1990) (P. Aczel, H. Simmons, and S. S. Wainer, eds.), Cambridge Univ. Press, Cambridge 1992, pp. 2-78.
71. W. Pohlers, "Subsystems of set theory and second order number theory", Handbook of Proof Theory (S. R. Buss, ed.), North-Holland, Amsterdam 1998, pp. 209-335.
72. M. B. Pour-El and S. Kripke, "Deduction-preserving 'recursive isomorphisms' between theories", Fund. Math. 61 (1967), 141-163.
73. L. J. Pozsgay, "Gödel's second theorem for elementary arithmetic", Z. Math. Logik Grundlagen Math. 14 (1968), 67-80.
74. M. O. Rabin, "Non-standard models and independence of the induction axiom", Essays on the Foundations of Mathematics. Dedicated to A. Fraenkel on his 70th anniversary, Magnes Press, Hebrew Univ., Jerusalem 1964, pp. 287-299.
75. 1-CA and related systems", Bull. Symbolic Logic 1 (1995), 468-485.
76. M. Rathjen, "The realm of ordinal analysis", London Math. Soc. Lecture Note Ser. 258 (1999), 219-279.
77. H. E. Rose, Subrecursion: Functions and hierarchies, Clarendon Press, New York 1984.
78. J. B. Rosser, "Extensions of some theorems of Gödel and Church", J. Symbolic Logic 1 (1936), 87-91.
79. J. B. Rosser, "Gödel Theorems for non-constructive logics", J. Symbolic Logic 2 (1937), 129-137.
80. U. R. Schmerl, "A fine structure generated by reflection formulas over primitive recursive arithmetic", Stud. Logic Found. Math. 97 (1979), 335-350.
81. H. Schwichtenberg, "Proof theory: Some applications of cut-elimination", Handbook of Mathematical Logic, Part D. Proof Theory and Constructive Mathematics (K. J. Barwise, ed.), North-Holland, Amsterdam 1977; Russian translation with supplements by G. E. Mints and V. P. Orevkov, Nauka, Moscow 1983, pp. 54-83.
82. K. Segerberg, An essay in classical modal logic, vols. I-III, Filosofiska Föreningen och Filosofiska Institutionen vid Uppsala Universitet, Uppsala 1971.
83. V. Yu. Shavrukov, "A note on the diagonalizable algebras of PA and ZF", Ann. Pure Appl. Logic 61 (1993), 161-173.
84. V. Yu. Shavrukov, "Subalgebras of diagonalizable algebras of theories containing arithmetic", Dissertationes Math. (Rozprany Mat.} 323 (1993), 1-82.
85. V. Yu. Shavrukov, "Isomorphisms of diagonalizable algebras", Theoria 63 (1997), 210-221.
86. V. Yu. Shavrukov, "Undecidability in diagonalizable algebras", J. Symbolic Logic 62 (1997), 79-116.
87. C. Smoryński, "ω-consistency and reflection", Colloque International de Logique (Clermont-Ferrand, 1975), (Colloq. Internat. CNRS, vol. 249) CNRS, Paris 1977, pp. 167-181.
88. C. Smoryński, "The incompleteness theorems", Handbook of Mathematical Logic, Part D. Proof Theory and Constructive Mathematics (K. J. Barwise, ed.), North-Holland, Amsterdam 1977; Russian translation with supplements by G. E. Mints and V. P. Orevkov, Nauka, Moscow, 1983, pp. 9-53.
89. C. Smoryński, "The finite inseparability of the first-order theory of diagonalizable algebras", Studia Logica 41 (1982), 347-349.
90. C. Smoryński, Self-reference and modal logic, Springer-Verlag, New York 1985.
91. R. M. Solovay, "Provability interpretations of modal logic", Israel J. Math. 25 (1976), 287-304.
92. R. Sommer, "Transfinite induction within Peano arithmetic", Ann. Pure Appl. Logic 76 (1995), 231-289.
93. R. Statman, "Bounds for proof-search and speed-up in the predicate calculus", Ann. Math. Logic 15 (1978), 225-287.
94. 1-CR: A constructive termination proof", Log. J. IGPL 11 (2003), 367-377.
95. A. M. Turing, "Systems of logic based on ordinals", Proc. London Math. Soc. (2) 45 (1939), 161-228.
96. A. Visser, "An overview of interpretability logic", Advances in Modal Logic (Berlin, 1996), vol. I (M. Kracht, et al., eds.), (CSLI Lecture Notes, vol. 87) CSLI Publications, Stanford 1998, pp. 307-359.
97. A. Wilkie and J. Paris, "On the scheme of induction for bounded arithmetic formulas", Ann. Pure Appl. Logic 35 (1987), 261-302.
98. 0 +exp", Notre Dame J. Formal Logic 35 (1994), 147-157.