Kolmogorov and Gödel's approach to intuitionistic logic: Current developments

Russian Mathematical Surveys

Volumn 59, Issue 2, 2004, Pages 203-229

  Artemov, S N ^a,b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4344603650     PISSN: 00360279     EISSN: 14684829     Source Type: Journal    
DOI: 10.1070/RM2004v059n02ABEH000715     Document Type: Review

References (95)

1. S. N. Artemov, "Nonarithmeticity of truth predicate logics of provability", Dokl. Akad. Nauk SSSR 284 (1985), 270-271; English transl., Soviet Math. Dokl 33 (1986), 403-405.
2. S. N. Artemov, "Nonarithmeticity of truth predicate logics of provability", Dokl. Akad. Nauk SSSR 284 (1985), 270-271; English transl., Soviet Math. Dokl 33 (1986), 403-405.
3. S. N. Artemov, "Embedding of the modal λ-calculus into the logic of proofs", Trudy Mat. Inst. Steklov. 242 (2003), 1-15; English transl., Proc. Steklov Inst. Math. 242 (2003), 36-49.
4. S. N. Artemov, "Embedding of the modal λ-calculus into the logic of proofs", Trudy Mat. Inst. Steklov. 242 (2003), 1-15; English transl., Proc. Steklov Inst. Math. 242 (2003), 36-49.
5. V. A. Vardanyan, "Arithmetical complexity or predicate logics of provability and their fragments", Dokl. Akad. Nauk SSSR 288 (1986), 11-14; English transl., Soviet Math. Dokl. 34 (1986), 384-387.
6. V. A. Vardanyan, "Arithmetical complexity or predicate logics of provability and their fragments", Dokl. Akad. Nauk SSSR 288 (1986), 11-14; English transl., Soviet Math. Dokl. 34 (1986), 384-387.
7. A. Heyting, Intuitionism: an introduction, North-Holland 1956; Russian transl., Mir, Moscow 1965.
8. S. C. Kleene, Introduction to metamathematics, Van Nostrand 1952; Russian transl., Inostr. Lit., Moscow 1957.
9. A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik", Math. Z. 35 (1932), 58-65; Reprinted in Russian, "On the interpretation of intuitionistic logic", Selected works of A. N. Kolmogorov, vol. I: Mathematics and mechanics, Nauka, Moscow 1985, pp. 142-148; English transl., Kluwer, Dordrecht 1991, pp. 151-158.
10. A. Kolmogoroff, "Zur Deutung der intuitionistischen Logik", Math. Z. 35 (1932), 58-65; Reprinted in Russian, "On the interpretation of intuitionistic logic", Selected works of A. N. Kolmogorov, vol. I: Mathematics and mechanics, Nauka, Moscow 1985, pp. 142-148; English transl., Kluwer, Dordrecht 1991, pp. 151-158.
11. A. N. Kolmogorov, "On my papers on intuitionistic logic", Selected works of A. N. Kolmogorov, vol. I: Mathematics and mechanics, Nauka, Moscow 1985, p. 393; English transl., Kluwer, Dordrecht 1991, pp. 451-452.
12. A. V. Kuznetsov and A. Yu. Muravitskii, "Logika Dokazuemosti", Abstracts, 4th All-Union Conf. on Mathematical Logic, 1976, p. 73. (Russian)
13. Yu. T. Medvedev, "Finitary problems", Dokl. Akad. Nauk SSSR 142 (1985), 1015-1018; English transl., Soviet Math. Dokl. 3 (1962), 227-230.
14. Yu. T. Medvedev, "Finitary problems", Dokl. Akad. Nauk SSSR 142 (1985), 1015-1018; English transl., Soviet Math. Dokl. 3 (1962), 227-230.
15. P. S. Novikov, Constructive mathematical logic from the classical viewpoint, Nauka, Moscow 1977. (Russian)
16. V. E. Plisko, "The nonarithmeticity of the class of realizable predicate formulas", Izv. Akad. Nauk SSSR Ser. Mat. 41 (1977), 483-502; English transl., Izv. Math.-USSR 11 (1977), 453-471.
17. V. E. Plisko, "The nonarithmeticity of the class of realizable predicate formulas", Izv. Akad. Nauk SSSR Ser. Mat. 41 (1977), 483-502; English transl., Izv. Math.-USSR 11 (1977), 453-471.
18. T. L. Sidon, "Craig interpolation property for operational Logics of Proofs", Vestnik. Moskov. Univ. Ser. I Mat. Mekh. 1998, no. 2, 34-38; English transl., Moscow Univ. Math. Bull. 53:2 (1999), 37-41.
19. T. L. Sidon, "Craig interpolation property for operational Logics of Proofs", Vestnik. Moskov. Univ. Ser. I Mat. Mekh. 1998, no. 2, 34-38; English transl., Moscow Univ. Math. Bull. 53:2 (1999), 37-41.
20. V. A. Uspensky and V. E. Plisko, "Intuitionistic logic", Selected works of A. N. Kolmogorov, vol. I: Mathematics and mechanics, Nauka, Moscow 1985, pp. 394-404; English transl., Kluwer, Dordrecht 1991, pp. 452-466.
21. J. Alt and S. Artemov, "Reflective λ-calculus", Lecture Notes in Comput. Sci. 2183 (2001), 22-37.
22. S. Artemov, "Kolmogorov's logic of problems and a provability interpretation of intuitionistic logic", Theoretical Aspects of Reasoning about Knowledge. III (Pacific Grove, 1990), Morgan Kaufman, San Mateo 1990, pp. 257-272.
23. S. Artemov, "Logic of Proofs", Ann. Pure Appl. Logic 67 (1994), 29-59.
24. S. Artemov, "Operational modal logic", Technical Report MSI 95-29, Cornell Univ., Ithaca 1995.
25. S. Artemov, "On explicit reflection in theorem proving and formal verification", Automated Deduction - CADE-16, Proc. 16th International Conf. on Automated Deduction (Trento, Italy, 1999), (Lecture Notes in Artificial Intelligence, vol. 1632) Springer-Verlag, Berlin 1999, pp. 267-281.
26. S. Artemov, "Explicit provability and constructive semantics", Bull. Symbolic Logic 7:1 (2001), 1-36.
27. S. Artemov, "Operations on proofs that can be specified by means of modal logic", Advances in Modal Logic, vol.11 (Uppsala, 1998), (CSLI Lecture Notes, vol. 119) CSLI Publications, Stanford 2001, pp. 59-72.
28. S. Artemov, "Unified semantics for modality and lambda-terms via proof polynomials", Algebras, Diagrams and Decisions in Language, Logic and Computation (K. Vermeulen and A. Copestake, eds.), (CSLI Lecture Notes, vol. 144) CSLI Publications, Stanford 2001, pp. 89-119.
29. S. Artemov, E. Kazakov, and D. Shapiro, "On logic of knowledge with justifications", Technical Report CFIS 99-12, Cornell Univ., Ithaca 1999; http://www.cs.gc.cuny.edu/~sartemov/publications/S5LP.ps.
30. S. Artemov and V. Krupski, "Data storage interpretation of labeled modal logic", Ann. Pure Appl. Logic 78 (1996), 57-71.
31. S. Artemov and T. Sidon-Yavorskaya, "On first-order Logic of Proofs", Mosc. Math. J. 1 (2001), 475-490.
32. S. Artemov and T. Straßen, "The basic Logic of Proofs", Lecture Notes in Comput. Sci. 702 (1993), 14-28.
33. S. Artemov and T. Strassen, "Functionality in the basic Logic of Proofs", Technical Report IAM 92-004, Department for Computer Science, Univ. of Bern, Bern 1993.
34. S. Artemov and T. Straßen, "The logic of the Gödel proof predicate", Lecture Notes in Comput. Sci. 713 (1993), 71-82.
35. J. Avigad and S. Feferman, "Gödel's functional 'Dialectica' interpretation", Handbook of Proof Theory (S. Buss, ed.), (Stud. Logic Found. Math., vol. 137) North-Holland, Amsterdam 1998, pp. 337-405.
36. M. Beeson, Foundations of constructive mathematics, Springer-Verlag. Berlin 1980.
37. L. Beklemishev, "Induction rules, reflection principles, and provably recursive functions". Ann. Pure Appl. Logic 85 (1997), 193-242.
38. J. van Benthem, "Reflections on epistemic logic", Logique et Anal. (N.S.) 34 (1991), 5-14.
39. G. Boolos, The unprovability of consistency: an essay in modal logic, Cambridge Univ. Press, Cambridge 1979.
40. G. Boolos, The logic of provability, Cambridge Univ. Press, Cambridge 1993.
41. V. Brezhnev, "On explicit counterparts of modal logics", Technical Report CFIS 2000-06, Cornell Univ., Ithaca 2000.
42. V. Brezhnev, "On the Logic of Proofs", Proc. 6th ESSLLI Student Session, Helsinki 2001, pp. 35-46; http://www.helsinki.fi/esslli/.
43. S. Buss, "The modal logic of pure provability", Notre Dame J. Formal Logic 31 (1990), 225-231.
44. R. Constable, "Types in logic, mathematics and programming", Handbook of Proof Theory (S. Buss, ed.), (Stud. Logic Found. Math., vol. 137) North-Holland, Amsterdam 1998, pp. 683-786.
45. D. van Dalen, "Intuitionistic logic", Handbook of Philosophical Logic, vol. III (D. Gabbay and F. Guenther, eds.), Reidel, Dordrecht 1986, pp. 225-340.
46. D. van Dalen, Logic and structure, Springer-Verlag, Berlin 1994.
47. M. Davis and J. Schwartz, "Metamathematical extensibility for theorem verifiers and proof checkers", Comput. Math. Appl. 5 (1979), 217-230.
48. S. Feferman, "Arithmetization of metamathematics in a general setting", Arch. Math. Logic 6 (1960), 52-63.
49. M. Fitting, "A semantic proof of the realizability of modal logic in the Logic of Proofs", CUNY PhD Program in Computer Science, Technical Report TR-2003010, New York 2003.
50. M. Fitting, "A semantics for the Logic of Proofs", CUNY PhD Program in Computer Science, Technical Report TR-2003012, New York 2003.
51. D. M. Gabbay, Labelled deductive systems, Oxford Univ. Press, New York 1994.
52. J.-Y. Girard, Y. Lafont, and P. Taylor, Proofs and types, Cambridge Univ. Press, Cambridge 1989.
53. K. Gödel, "Eine Interpretation des intuitionistischen Aussagenkalküls", Ergebnisse Math. Kolloquium Wien 4 (1933), 39-40.
54. K. Gödel, "Vortrag bei Zilsel" (1938), Kurt Gödel, Collected Works, vol. III (S. Feferman et al., eds.), Oxford Univ. Press, New York 1995.
55. R. Goldblatt, "Arithmetical necessity, provability and intuitionistic logic", Theoria 44 (1978), 38-46.
56. N. K. Goodman, "A theory of constructions is equivalent to arithmetic", Intuitionism and Proof Theory (J. Myhill, A. Kino, and R. E. Vesley, eds.), North-Holland, Amsterdam 1970, pp. 101-120.
57. A. Heyting, "Die intuitionistische Grundlegung der Mathematik", Erkenntnis 2 (1931), 106-115.
58. A. Heyting, Mathematische Grundlagenforschung. Intuitionismus. Beweistheorie, Springer-Verlag, Berlin 1934.
59. D. de Jongh and G. Japaridze, "The logic of provability", Handbook of Proof Theory (S. Buss, ed.), (Stud. Logic Found. Math., vol. 137) North-Holland, Amsterdam 1998, pp. 475-546.
60. S. C. Kleene, "On the interpretation of intuitionistic number theory", J. Symbolic Logic 10 (1945), 109-124.
61. G. Kreisel, "Foundations of intuitionistic logic", Logic, Methodology and Philosophy of Science. Proc. 1960 International Congress (E. Nagel, P. Suppes, and A. Tarski, eds.), Stanford Univ. Press, Stanford 1962, pp. 198-210.
62. G. Kreisel, "On weak completeness of intuitionistic predicate logic", J. Symbolic Logic 27 (1962), 139-158.
63. G. Kreisel, "Mathematical logic", Lectures in Modern Mathematics, vol. III (T. L. Saaty, ed.), Wiley, New York 1965, pp. 95-195.
64. S. A. Kripke, "Semantical considerations on modal logic", Acta Philosophica Fennica 16 (1963), 83-94.
65. N. V. Krupski, "On the complexity of the reflected Logic of Proofs". CUNY PhD Program in Computer Science, Technical Report TR-2003007, New York 2003.
66. V. N. Krupski, "Operational Logic of Proofs with functionality condition on proof predicate", lecture Notes in Comput. Sci. 1234 (1997), 167-177.
67. V. N. Krupski, "The single-conclusion proof logic and inference rules specification", Ann. Pure Appl. Logic 113:1-3 (2002), 181-206.
68. V. N. Krupski, "Referential Logic of Proofs", Theoretical Computer Science (2004), accepted for publication.
69. R. Kuznets, "On the complexity of explicit modal logics". Lecture Notes in Comput. 3d. 1862 (2000), 371-383.
70. H. Läuchli, "An abstract notion of realizability for which intuitionistic predicate calculus is complete", Intuitionism and Proof Theory (J. Myhill, A.Kino, and R. E. Vesley, eds.), North-Holland, Amsterdam 1970, pp. 227-234.
71. E. Lemmon, "New foundations for Lewis's modal systems", J. Symbolic Logic 22 (1957), 176-186.
72. J. C. C. McKinsey and A. Tarski, "Some theorems about the sentential calculi of Lewis and Heyting", J. Symbolic Logic 13 (1948), 1-15.
73. G. E. Mints, "Lewis' systems and system T (1965-1973)", Selected Papers in Proof Theory, Bibliopolis, Napoli 1992.
74. A. Mkrtychev, "Models for the Logic of Proofs", Lecture Notes in Comput. Sci. 1234 (1997), 266-275.
75. R. Montague, "Syntactical treatments of modality with corollaries on reflection principles and finite axiomatizability", Acta Philosophica Fennica 16 (1963), 153-168.
76. J. Myhill, "Some remarks on the notion of proof", J. Philos. 57 (1960), 461-471.
77. J. Myhill, "Intensional set theory", Intensional Mathematics (S. Shapiro, ed.), North-Holland, Amsterdam 1985, pp. 47-61.
78. Y. Moses, "Resource-bounded knowledge", Proc. 2nd Conf. on Theoretical Aspects of Reasoning about Knowledge (Pacific Grove, 1988) (M. Vardi, ed.), Morgan Kaufmann, Los Altos 1988, pp. 261-275.
79. R. Parikh, "Knowledge and the problem of logical omniscience", ISMIS-87 (International Symposium on Methodology for Intelligent Systems, Charlotte, 1987) (Z. Ras and M. Zemankova, eds.), North-Holland, New York 1987, pp. 432-439.
80. R. Parikh, "Logical omniscience", Lecture Notes in Comput. Sci. 960 (1995), 22-29.
81. B. Renne, "Tableaux for the Logic of Proofs", CUNY PhD Program in Computer Science, Technical Report TR-2004001, New York 2004.
82. D. Scott, "Constructive validity", Lecture Notes in Math. 125 (1970), 237-275.
83. S. Shapiro, "Intensional mathematics and constructive mathematics", Intensional Mathematics (S. Shapiro, ed.), North-Holland, Amsterdam 1985, pp. 1-10.
84. S. Shapiro, "Epistemic and intuitionistic arithmetic", Intensional Mathematics (S. Shapiro, ed.), North-Holland, Amsterdam 1985, pp. 11-46.
85. T. Sidon, "Provability logic with operations on proofs", Lecture Notes in Comput. Sci. 1234 (1997), 342-353.
86. T. Yavorskaya [Sidon], "Logic of Proofs and provability", Ann. Pure Appl. Logic 113:1-3 (2002), 345-372.
87. C. Smoryński, Self-reference and modal logic, Springer-Verlag, New York 1985.
88. R. Solovay, "Provability interpretations of modal logic", Israel J. Math. 25 (1976), 287-304.
89. A. S. Troelstra, "Realizability", Handbook of Proof Theory (S. Buss, ed.), (Stud. Logic Found. Math., vol. 137) Elsevier, Amsterdam 1998, pp. 407-474.
90. A. S. Troelstra and D. van Dalen, Constructivism in mathematics, vol. I. An introduction, North-Holland, Amsterdam 1988.
91. A. S. Troelstra and H. Schwichtenberg, Basic proof theory, (Cambridge Tracts Theoret. Comput. Sci., vol. 43) Cambridge Univ. Press, Cambridge 1996.
92. V. A. Uspensky, "Kolmogorov and mathematical logic", J. Symbol. Logic 57 (1992), 385-412.
93. S.Weinstein, "The intended interpretation of intuitionistic logic", J. Philos. Logic 12 (1983), 261-270.
94. R. Yavorsky, "On the logic of the standard proof predicate", Lecture Notes in Comput. Sci. 1862 (2000), 527-541.
95. R. Yavorsky, "Provability logics with quantifiers on proofs", Ann. Pure Appl. Logic 113:1-3 (2002), 373-387.