Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
W. Ackermann. Zur Wiederspruchsfreiheit der reinen Zahlentheorie. Math. Ann., 117:162–194, 1940.
Z. Adamovicz and T. Bigorajska. Functions provably total in I −Σ1. Fundamenta mathematicae, 132:189–194, 1989.
[Allen et al., 1990] S. Allen, R. Constable, D. Howe, and W. Aitken. The semantics of refected proofs. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 95–107, Los Alamitos, CA, USA, 1990. IEEE Computer Society Press.
J. Alt and S. Artemov. Refective λ-calculus. In Proceedings of the Dagstuhl-Seminar on Proof Theory in Computer Science, volume 2183 of Lecture Notes in Computer Science, pages 22–37. Springer, 2001.
S.N. Artemov and L.D. Beklemishev. On propositional quantifiers in provability logic. Notre Dame Journal of Formal Logic, 34:401–419, 1993.
S. Artemov and V. Krupski. Data storage interpretation of labeled modal logic. Annals of Pure and Applied Logic, 78(1):57–71, 1996.
S. Artemov and E. Nogina. Logic of knowledge with justifications from the provability perspective. Technical Report TR-2004011, CUNY Ph.D. Program in Computer Science, 2004.
S. Artemov and T. Sidon-Yavorskaya. On the first order logic of proofs. Moscow Mathematical Journal, 1:475–490, 2001.
S. Artemov and T. Strassen. The basic logic of proofs. In E. Börger, G. Jäger, H. Kleine Büning, S. Martini, and M. M. Richter, editors, Computer Science Logic. 6th Workshop, CSL’92. San Miniato, Italy, September/October 1992. Selected Papers, volume 702 of Lecture Notes in Computer Science, pages 14–28. Springer, 1992.
S. Artemov and T. Strassen. Functionality in the basic logic of proofs. Technical Report IAM 92-004, Department of Computer Science, University of Bern, Switzerland, 1992.
S. Artemov and T. Strassen. The logic of the Gödel proof predicate. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Computational Logic and Proof Theory. Third Kurt Gödel Colloquium, KGC’93. Brno, Chech Republic, August 1993. Proceedings, volume 713 of Lecture Notes in Computer Science, pages 71–82. Springer, 1993.
[Artemov et al., 1999] S. Artemov, E. Kazakov, and D. Shapiro. Epistemic logic with justifications. Technical Report CFIS 99-12, Cornell University, 1999.
S.N. Artemov. Extensions of arithmetic and modal logics. PhD thesis, Steklov Mathematical Insitute, Moscow, 1979. In Russian.
S.N. Artemov. Arithmetically complete modal theories. In Semiotika i Informatika, 14, pages 115–133. VINITI, Moscow, 1980. In Russian. English translation in: Amer. Math. Soc. Transl. (2), 135: 39–54, 1987.
S.N. Artemov. Applications of modal logic in proof theory. In Problems of Cyberneticsr: Nonclassical logics and their applications, pages 3–20. Nauka, Moscow, 1982. In Russian.
S.N. Artemov. Nonarithmeticity of truth predicate logics of provability. Doklady Akad. Nauk SSSR, 284(2):270–271, 1985. In Russian. English translation in Soviet Mathematics Doklady 33:403–405, 1985.
S.N. Artemov. On modal logics axiomatizing provability. Izvestiya Akad. pmNauk SSSR, ser. mat., 49(6):1123–1154, 1985. In Russian. English translation in: Math. USSR Izvestiya 27(3).
S.N. Artemov. Numerically correct provability logics. Doklady Akad. Nauk SSSR, 290(6):1289–1292, 1986. In Russian. English translation in Soviet Mathematics Doklady 34:384–387, 1987.
S. Artemov. Kolmogorov logic of problems and a provability interpretation of intuitionistic logic. In Theoretical Aspects of Reasoning about Knowledge — III Proceedings, pages 257–272. Morgan Kaufman Pbl., 1990.
S. Artemov. Logic of proofs. Annals of Pure and Applied Logic, 67(1):29–59, 1994.
S. Artemov. Operational modal logic. Technical Report MSI 95-29, Cornell University, 1995.
S. Artemov. Logic of proofs: a unified semantics for modality and λ-terms. Technical Report CFIS 98-06, Cornell University, 1998.
S. Artemov. On explicit reflection in theorem proving and formal verification. In Automated Deduction — CADE-16. Proceedings of the 16th International Conference on Automated Deduction, Trento, Italy, July 1999, volume 1632 of Lecture Notes in Artificial Intelligence, pages 267–281. Springer, 1999.
S. Artemov. Operations on proofs that can be specified by means of modal logic. In Advances in Modal Logic. Volume 2. CSLI Publications, Stanford University, 2000.
S. Artemov. Explicit provability and constructive semantics. Bulletin of Symbolic Logic, 7(1):1–36, 2001.
S. Artemov. Unified semantics for modality and λ-terms via proof polynomials. In K. Vermeulen and A. Copestake, editors, Algebras, Diagrams and Decisions in Language, Logic and Computation, pages 89–119. CSLI Publications, Stanford University, 2002.
S. Artemov. Kolmogorov and Gödel’s approach to intuitionistic logic: current developments. Russian Mathematical Surveys, 59(2):203–229, 2004.
J. Avigad and S. Feferman. Gödel’s functional (”Dialectica“) interpretation. In S. Buss, editor, Handbook of Proof Theory, pages 337–406. Elsevier, 1998.
A. Avron. On modal systems having arithmetical interpretations. The Journal of Symbolic Logic, 49:935–942, 1984.
M. Beeson. The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations. The Journal of Symbolic Logic, 40:321–346, 1975.
M. Beeson. Foundations of Constructive Mathematics. Springer-Verlag, 1980.
[Beklemishev et al., 1999] L.D. Beklemishev, M. Pentus, and N. Vereshchagin. Provability, complexity, grammars. American Mathematical Society Translations, Series 2, 192, 1999.
L.D. Beklemishev. On the classification of propositional provability logics. Izvestiya Akademii Nauk SSSR, ser. mat., 53(5):915–943, 1989. In Russian. English translation in Math.USSR Izvestiya 35 (1990) 247–275.
L.D. Beklemishev. A provability logic without Craig’s interpolation property. Matematicheskie Zametki, 45(6):12–22, 1989. In Russian. English translation in Math. Notes 45 (1989).
L.D. Beklemishev. Provability logics for natural Turing progressions of arithmetical theories. Studia Logica, 50(1):107–128, 1991.
L.D. Beklemishev. Independent numerations of theories and recursive progressions. Sibirskii Matematichskii Zhurnal, 33(5):22–46, 1992. In Russian. English translation in Siberian Math. Journal, 33 (1992).).
L.D. Beklemishev. On bimodal logics of provability. Annals of Pure and Applied Logic, 68(2):115–160, 1994.
L.D. Beklemishev. Bimodal logics for extensions of arithmetical theories. The Journal of Symbolic Logic, 61(1):91–124, 1996.
L.D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of Pure and Applied Logic, 85:193–242, 1997.
L.D. Beklemishev. Notes on local reflection principles. Theoria, 63(3):139–146, 1997.
L.D. Beklemishev. Parameter free induction and reflection. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Lecture Notes in Computer Science 1289. Computational Logic and Proof Theory, 5-th K.Gödel Colloquium KGC’97, Proceedings, pages 103–113. Springer-Verlag, Berlin, 1997.
L.D. Beklemishev. A proof-theoretic analysis of collection. Archive for Mathematical Logic, 37:275–296, 1998.
L.D. Beklemishev. Reflection principles in formal arithmetic. Doctor of Sciences Dissertation, Steklov Math. Institute, Moscow. In Russian, 1998.
L.D. Beklemishev. Open least element principle and bounded query computation. In J. Flum and M. Rodrigues-Artalejo, editors, Lecture Notes in Computer Science 1683. Computer Science Logic, 13-th international workshop, CSL’99. Madrid, Spain, September 20–25, 1999. Proceedings, pages 389–404. Springer-Verlag, Berlin, 1999.
L.D. Beklemishev. Parameter free induction and provably total computable functions. Theoretical Computer Science, 224(1-2):13–33, 1999.
L.D. Beklemishev. Provability algebras and proof-theoretic ordinals, I. Logic Group Preprint Series 208, University of Utrecht, 2001. http://preprints.phil.uu.nl/lgps/.
L.D. Beklemishev. Proof-theoretic analysis by iterated reflection. Archive for Mathematical Logic, 42:515–552, 2003. DOI: 10.1007/s00153-002-0158-7.
L.D. Beklemishev. The Worm principle. Logic Group Preprint Series 219, University of Utrecht, 2003. http://preprints.phil.uu.nl/lgps/.
L.D. Beklemishev. Provability algebras and proof-theoretic ordinals, I. Annals of Pure and Applied Logic, 128:103–123, 2004.
G. Bellin. A system of natural deduction for GL. Theoria, 51:89–114, 1985.
A. Berarducci and R. Verbrugge. On the provability logic of bounded arithmetic. Annals of Pure and Applied Logic, 61:75–93, 1993.
A. Berarducci. The interpretability logic of Peano Arithmetic. The Journal of Symbolic Logic, 55:1059–1089, 1990.
C. Bernardi. The uniqueness of the fixed point in every diagonalizable algebra. Studia Logica, 35:335–343, 1976.
G. Boolos and V. McGee. The degree of the set of sentences of predicate provability logic that are true under every interpretation. The Journal of Symbolic Logic, 52(1):165–171, 1987.
G. Boolos and G. Sambin. Provability: the emergence of a mathematical modality. Studia Logica, 50(1):1–23, 1991.
G. Boolos. On deciding the truth of certain statements involving the notion of consistency. Journal of Symbolic Logic, 41:779–781, 1976.
G. Boolos. Reflection principles and iterated consistency assertions. The Journal of Symbolic Logic, 44:33–35, 1979.
G. Boolos. The Unprovability of Consistency: An Essay in Modal Logic. Cambridge University Press, Cambridge, 1979.
G. Boolos. Omega-consistency and the diamond. Studia Logica, 39:237–243, 1980.
G. Boolos. Extremely undecidable sentences. The Journal of Symbolic Logic, 47:191–196, 1982.
G. Boolos. The Logic of Provability. Cambridge University Press, Cambridge, 1993.
V. Brezhnev. On explicit counterparts of modal logics. Technical Report CFIS 2000-05, Cornell University, 2000.
V. Brezhnev. On the logic of proofs. In Proceedings of the Sixth ESSLLI Student Session, Helsinki, pages 35–46, 2001. http://www.helsinki.fi/esslli/.
R. Bull and K. Segerberg. Basic modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd ed., volume 3, pages 1–83. Kluwer, Dordrecht, 2001.
W. Burr. Fragments of Heyting arithmetic. The Journal of Symbolic Logic, 65(3):1223–1240, 2000.
S. Buss. Bounded arithmetic. Bibliopolis, Napoli, 1986.
S. Buss. The modal logic of pure provability. Notre Dame Journal of Formal Logic, 31(2):225–231, 1990.
S.R. Buss. Introduction to Proof Theory. In S.R. Buss, editor, Handbook of Proof Theory, pages 1–78, Amsterdam, 1998. Elsevier, North-Holland.
A. Carbone and F. Montagna. Rosser orderings in bimodal logics. Zeitschrift f. math. Logik und Grundlagen d. Math., 35:343–358, 1989.
A. Carbone and F. Montagna. Much shorter proofs: A bimodal investigation. Zeitschrift f. math. Logik und Grundlagen d. Math., 36:47–66, 1990.
T. Carlson. Modal logics with several operators and provability interpretations. Israel Journal of Mathematics, 54:14–24, 1986.
A. Chagrov and M. Zakharyaschev. Modal Logic. Oxford Science Publications, 1997.
[Chagrov et al., 2001] A.V. Chagrov, F. Wolter, and M. Zakhariashchev. Advanced modal logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd ed., volume 3, pages 83–266. Kluwer, Dordrecht, 2001.
A.V. Chagrov. On the complexity of propositional logics. In Complexity problems in Mathematical Logic, pages 80–90. Kalinin State University, Kalinin, 1985. In Russian.
Robert L. Constable. Using reflection to explain and enhance type theory. In Helmut Schwichtenberg, editor, Proof and Computation, volume 139 of NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany, July 20–August 1, NATO Series F, pages 65–100. Springer, Berlin, 1994.
R. Constable. Types in logic, mathematics and programming. In S. Buss, editor, Handbook of Proof Theory, pages 683–786. Elsevier, 1998.
N. Cutland. Computability. An introduction to recursive function theory. Cambridge University Press, Cambridge, etc., 1980.
M. Davis and J. Schwartz. Metamathematical extensibility for theorem verifiers and proof checkers. Computers and Mathematics with Applications, 5:217–230, 1979.
D. de Jongh and G. Japaridze. The Logic of Provability. In S.R. Buss, editor, Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics, Vol.137., pages 475–546. Elsevier, Amsterdam, 1998.
D. de Jongh and F. Montagna. Much shorter proofs. Z. Math. Logik Grundlagen Math., 35(3):247–260, 1989.
D. de Jongh and A. Visser. Embeddings of Heyting algebras. In W. et al. Hodges, editor, Logic: from foundations to applications. European Logic Colloquium, Keele, UK, July 20–29, 1993, pages 187–213. Clarendon Press, Oxford, 1996.
D. de Jongh. The maximality of the intuitionistic predicate calculus with respect to Heyting’s Arithmetic. The Journal of Symbolic Logic, 36:606, 1970.
G. Dzhaparidze. The logic of linear tolerance. Studia Logica, 51(2):249–277, 1992.
G. Dzhaparidze. A generalized notion of weak interpretability and the corresponding modal logic. Annals of Pure and Applied Logic, 61(1-2):113–160, 1993.
[Fagin et al., 1995] R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning About Knowledge. MIT Press, 1995.
S. Feferman. Arithmetization of metamathematics in a general setting. Fundamenta Mathematicae, 49:35–92, 1960.
S. Feferman. Transfinite recursive progressions of axiomatic theories. The Journal of Symbolic Logic, 27:259–316, 1962.
M. Fitting. A semantic proof of the realizability of modal logic in the logic of proofs. Technical Report TR-2003010, CUNY Ph.D. Program in Computer Science, 2003.
M. Fitting. A semantics for the logic of proofs. Technical Report TR-2003012, CUNY Ph.D. Program in Computer Science, 2003.
M. Fitting. Semantics and tableaus for LPS4. Technical Report TR-2004016, CUNY Ph.D. Program in Computer Science, 2004.
M. Fitting. The logic of proofs, semantically. To appear in Annals of Pure and Applied Logic. Available on http://comet.lehman.cuny.edu/fitting., 2005.
H. Friedman. 102 problems in mathematical logic. The Journal of Symbolic Logic, 40:113–129, 1975.
H. Friedman. The disjunction property implies the numerical existence property. Proc. Nat. Acad. USA, 72:2877–2878, 1975.
H. Friedman. Some applications of Kleene’s methods for intuitionistic systems. In A.R.D. Mathias and H. Rogers, editors, Cambridge Summerschool in Mathematical Logic, pages 113–170. Springer-Verlag, Berlin, 1975.
D.M. Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.
Yu.V. Gavrilenko. Recursive realizability from the intuitionistic point of view. Soviet Math. Doklady, 23:9–14, 1981.
G. Gentzen. Die Wiederspruchsfreiheit der reinen Zahlentheorie. Math. Ann., 112:493–565, 1936.
G. Gentzen. Neue Fassung des Wiederspruchsfreiheitsbeweises für die reine Zahlentheorie. Forschungen zur Logik ung Grundlegung der exakten Wissenschaften, 4:19–44, 1938.
S. Ghilardi and M. Zawadowski. A sheaf representation and duality for finitely presented Heyting algebras. The Journal of Symbolic Logic, 60:911–939, 1995.
S. Ghilardi. Unification in intuitionistic logic. The Journal of Symbolic Logic, 64:859–880, 1999.
S. Ghilardi. Best solving modal equations. Annals of Pure and Applied Logic, 102:183–198, 2000.
[Girard et al., 1989] J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
K. Gödel. Eine Interpretation des intuitionistischen Aussagenkalkuls. Ergebnisse Math. Kolloq., 4:39–40, 1933. English translation in: S. Feferman et al., editors, Kurt Gödel Collected Works, Vol. 1, pages 301–303. Oxford University Press, Oxford, Clarendon Press, New York, 1986.
K. Gödel. Vortrag bei Zilsel, 1938. In S. Feferman, editor, Kurt Gödel Collected Works. Volume III, pages 86–113. Oxford University Press, 1995.
R. Goldblatt. Arithmetical necessity, provability and intuitionistic logic. Theoria, 44:38–46, 1978.
S.S. Goncharov. Countable Boolean algebras and decidability, Siberian School of Algebra and Logic. Plenum Press, New York, 1997. Russian original: Schetnye bulevy algebry i razreshimost’. Sibirskaya Shkola Algebry i Logiki. Novosibirsk: Nauchnaya Kniga. xii, 362 p. (1996).
N.D. Goodman. A theory of constructions is equivalent to arithmetic. In J. Myhill, A. Kino, and R.E. Vesley, editors, Intuitionism and Proof Theory, pages 101–120. North-Holland, 1970.
S. Goryachev. On interpretability of some extensions of arithmetic. Mat. Zametki, 40:561–572, 1986. In Russian. English translation in Math. Notes, 40.
R.Sh. Grigolia. Free algebras of non-classical logics. Metzniereba, Tbilissi, 1987. In Russian.
A. Grzegorczyk. Some classes of recursive functions. In Rozprawy Matematiczne, IV. Warszawa, 1953.
D. Guaspari and R. Solovay. Rosser sentences. Annals of Math. Logic, 16:81–99, 1979.
D. Guaspari. Partially conservative sentences and interpretability. Transactions of AMS, 254:47–68, 1979.
P. Hájek and F. Montagna. The logic of Π1-conservativity. Archive for Mathematical Logic, 30(2):113–123, 1990.
P. Hájek and F. Montagna. The logic of Π1-conservativity continued. Archive for Mathematical Logic, 32:57–63, 1992.
P. Hájek and P. Pudlák. Metamathematics of First Order Arithmetic. Springer-Verlag, Berlin, Heidelberg, New York, 1993.
J. Harrison. Methatheory and reflection in theorem proving: A survey and critique. Technical report, University of Cambridge, 1995. URL http://www.dcs.glasgow.ac.uk/ tfm/hol-bib.html#H.
A. Heyting. Die intuitionistische grundlegung der mathematik. Erkenntnis, 2:106–115, 1931.
A. Heyting. Mathematische Grundlagenforschung. Intuitionismus. Beweistheorie. Springer, Berlin, 1934.
D. Hilbert and P. Bernays. Grundlagen der Mathematik, Vols. I and II, 2d ed. Springer-Verlag, Berlin, 1968.
R. Iemhoff. A modal analysis of some principles of the provability logic of Heyting arithmetic. In Advances in modal logic. Vol. 2. Selected papers from the 2nd international workshop (AiML’ 98), Uppsala, Sweden, October 16–18, 1998. CSLI Lecture Notes 119, pages 301–336. CSLI Publications, Stanford, 2001.
R. Iemhoff. On the admissible rules of intuitionistic propositional logic. The Journal of Symbolic Logic, 66(1):281–294, 2001.
R. Iemhoff. Provability logic and admissible rules. PhD thesis, University of Amsterdam, Amsterdam, 2001.
K.N. Ignatiev. Partial conservativity and modal logics. ITLI Prepublication Series X-91-C04, University of Amsterdam, 1991.
K.N. Ignatiev. On strong provability predicates and the associated modal logics. The Journal of Symbolic Logic, 58:249–290, 1993.
K.N. Ignatiev. The provability logic for Σ1-interpolability. Annals of Pure and Applied Logic, 64:1–25, 1993.
G.K. Japaridze. The modal logical means of investigation of provability. Thesis in Philosophy, in Russian, Moscow, 1986.
G.K. Japaridze. The polymodal logic of provability. In Intensional Logics and Logical Structure of Theories: Material from the fourth Soviet-Finnish Symposium on Logic, Telavi, May 20–24, 1985, pages 16–48. Metsniereba, Tbilisi, 1988. In Russian.
G. Japaridze. A simple proof of arithmetical completeness for Π1-conservativity logic. Notre Dame Journal of Formal Logic, 35:346–354, 1994.
[Kaye et al., 1988] R. Kaye, J. Paris, and C. Dimitracopoulos. On parameter free induction schemas. The Journal of Symbolic Logic, 53(4):1082–1097, 1988.
L.A.S. Kirby and J.B. Paris. Accessible independence results for Peano arithmetic. Bull. London Math. Soc., 14:285–293, 1982.
S. Kleene. On the interpretation of intuitionistic number theory. The Journal of Symbolic Logic, 10(4):109–124, 1945.
S. Kleene. Introduction to Metamathematics. Van Norstrand, 1952.
A. Kolmogoro. Zur Deutung der intuitionistischen logik. Mathematische Zeitschrift, 35:58–65, 1932. In German. English translation in V.M. Tikhomirov, editor, Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, pages 151–158. Kluwer, Dordrecht 1991.
A.N. Kolmogorov. About my papers on intuitionistic logic. In V.M. Tikhomirov, editor, Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, page 393. Nauka, Moscow, 1985. In Russian, English translation in V.M. Tikhomirov, editor, Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, pages 451–452. Kluwer, Dordrecht 1991.
D. Kozen and J. Tiuryn. Logic of programs. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Volume B, Formal Models and Semantics, pages 789–840. Elsevier, 1990.
G. Kreisel and A. Lévy. Reflection principles and their use for establishing the complexity of axiomatic systems. Zeitschrift f. math. Logik und Grundlagen d. Math., 14:97–142, 1968.
G. Kreisel. On the interpretation of non-finitist proofs, II. The Journal of Symbolic Logic, 17:43–58, 1952.
G. Kreisel. Foundations of intuitionistic logic. In E. Nagel, P. Suppes, and A. Tarski, editors, Logic, Methodology and Philosophy of Science. Proceedings of the 1960 International Congress, pages 198–210. Stanford University Press, 1962.
G. Kreisel. On weak completeness of intuitionistic predicate logic. The Journal of Symbolic Logic, 27:139–158, 1962.
G. Kreisel. Mathematical logic. In T.L. Saaty, editor, Lectures in Modern Mathematics III, pages 95–195. Wiley and Sons, New York, 1965.
S. Kripke. Semantical considerations on modal logic. Acta Philosophica Fennica, 16:83–94, 1963.
V. Krupski. Operational logic of proofs with functionality condition on proof predicate. In S. Adian and A. Nerode, editors, Logical Foundations of Computer Science’ 97, Yaroslavl’, volume 1234 of Lecture Notes in Computer Science, pages 167–177. Springer, 1997.
V. Krupski. The single-conclusion proof logic and inference rules specification. Annals of Pure and Applied Logic, 113(1-3):181–201, 2002.
V. Krupski. Referential logic of proofs. Theoretical Computer Science, (accepted), 2005.
N.V. Krupski (jr.). On the complexity of the reflected logic of proofs. Technical Report TR-2003007, CUNY Ph. D. Program in Computer Science, 2003.
R. Kuznets. On the complexity of explicit modal logics. In Computer Science Logic 2000, volume 1862 of Lecture Notes in Computer Science, pages 371–383. Springer-Verlag, 2000.
A. Kuznetsov and A. Muravitsky. The logic of provability. In Abstracts of the 4-th All-Union Conference on Mathematical Logic, page 73, Kishinev, 1976. In Russian.
A.V. Kuznetsov and A.Yu. Muravitsky. Magari algebras. In Fourteenth All-Union Algebra Conf., Abstract part 2: Rings, Algebraic Structures, pages 105–106, 1977. In Russian.
A.V. Kuznetsov and A.Yu. Muravitsky. On superintuitionistic logics as fragments of proof logic. Studia Logica, XLV:76–99, 1986.
H. Läuchli. An abstract notion of realizability for which intuitionistic predicate logic is complete. In J. Myhill, A. Kino, and R.E. Vesley, editors, Intuitionism and Proof Theory, pages 227–234. North-Holland, 1970.
D. Leivant. On the proof theory of the modal logic for arithmetic provability. The Journal of Symbolic Logic, 46:531–538, 1981.
D. Leivant. The optimality of induction as an axiomatization of arithmetic. The Journal of Symbolic Logic, 48:182–184, 1983.
E. Lemmon. New foundations for Lewis’s modal systems. The Journal of Symbolic Logic, 22:176–186, 1957.
P. Lindström. On partially conservative sentences and interpretability. Proceedings of the AMS, 91(3):436–443, 1984.
P. Lindström. The modal logic of Parikh provability. Tech. Rep. Filosofiska Meddelanden, Gröna Serien 5, Univ. Göteborg, 1994.
P. Lindström. Provability logic — a short introduction. Theoria, 62(1-2):19–61, 1996.
M.H. Löb. Solution of a problem of Leon Henkin. The Journal of Symbolic Logic, 20:115–118, 1955.
R. Magari. The diagonalizable algebras (the algebraization of the theories which express Theor.: II). Bollettino della Unione Matematica Italiana, Serie 4, 12, 1975. Suppl. fasc. 3, 117–125.
R. Magari. Representation and duality theory for diagonalizable algebras (the algebraization of theories which express Theor.:IV). Studia Logica, 34:305–313, 1975.
J. McCarthy. Notes on self-awareness. Internet posting by URL http://www-formal.stanford.edu/jmc/selfaware/selfaware.html, April 2004.
J.C.C. McKinsey and A. Tarski. On closed elements of closure algebras. Annals of Mathematics, 47:122–162, 1946.
J.C.C. McKinsey and A. Tarski. Some theorems about the sentential calculi of Lewis and Heyting. The Journal of Symbolic Logic, 13:1–15, 1948.
Yu. Medvedev. Finite problems. Soviet Mathematics Doklady, 3:227–230, 1962.
A.R. Meyer. The inherent complexity of theories of ordered sets. In Proceedings of the international congress of math., Vancouver, 1974, pages 477–482. Canadian Math. Congress, 1975.
G.E. Mints. Quantifier free and one quantifier systems. Zapiski nauchnyh seminarov LOMI, 20:115–133, 1971. In Russian.
G. Mints. Lewis’ systems and system T (a survey 1965–1973). In Feys. Modal Logic (Russian translation), pages 422–509. Nauka, Moscow, 1974. In Russian, English translation in G. Mints, Selected papers in proof theory, Bibliopolis, Napoli, 1992.
A. Mkrtychev. Models for the logic of proofs. In S. Adian and A. Nerode, editors, Logical Foundations of Computer Science’ 97, Yaroslavl’, volume 1234 of Lecture Notes in Computer Science, pages 266–275. Springer, 1997.
F. Montagna. On the algebraization of a Feferman’s predicate (the algebraiztion of theories which express Theor; X). Studia Logica, 37:221–236, 1978.
F. Montagna. On the diagonalizable algebra of Peano arithmetic. Bollettino della Unione Matematica Italiana, B (5), 16:795–812, 1979.
F. Montagna. Undecidability of the first order theory of diagonalizable algebras. Studia Logica, 39:347–354, 1980.
F. Montagna. The predicate modal logic of provability. Notre Dame Journal of Formal Logic, 25:179–189, 1987.
F. Montagna. Provability in. nite subtheories of PA. The Journal of Symbolic Logic, 52(2):494–511, 1987.
R. Montague. Syntactical treatments of modality with corollaries on reflection principles and finite axiomatizability. Acta Philosophica Fennica, 16:153–168, 1963.
Y. Moses. Resource-bounded knowledge. In M. Vardi, editor, Theoretical Aspects of Reasoning about Knowledge, pages 261–276. Morgan Kaufman Pbl., 1988.
A. Mostowski. On models of axiomatic systems. Fundamenta Mathematicae, 39:133–158, 1953.
J. Myhill. Some remarks on the notion of proof. Journal of Philosophy, 57:461–471, 1960.
J. Myhill. Intensional set theory. In S. Shapiro, editor, Intensional Mathematics, pages 47–61. North-Holland, 1985.
E. Nogina. Logic of proofs with the strong provability operator. Technical Report ILLC Prepublication Series ML-94-10, Institute for Logic, Language and Computation, University of Amsterdam, 1994.
E. Nogina. Grzegorczyk logic with arithmetical proof operators. Fundamental and Applied Mathematics, 2(2):483–499, 1996. In Russian, URL http://mech.math.msu.su/∼fpm/eng/96/962/96206.htm.
H. Ono. Reflection principles in fragments of Peano Arithmetic. Zeitschrift f. math. Logik und Grundlagen d. Math., 33(4):317–333, 1987.
V.P. Orevkov. Lower bounds for lengthening of proofs after cut-elimination. Zapiski Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova, 88:137–162, 1979. In Russian. English translation in: Journal of Soviet Mathematics 20, 2337–2350 (1982).
I.E. Orlov. The calculus of compatibility of propositions. Matematicheskii Sbornik, 35:263–286, 1928. In Russian.
R. Parikh. Existence and feasibility in arithmetic. The Journal of Symbolic Logic, 36:494–508, 1971.
R. Parikh. Knowledge and the problem of logical omniscience. In Z. Ras and M. Zemankova, editors, ISMIS-87 (International Symposium on Methodolody for Intellectual Systems), pages 432–439. North-Holland, 1987.
R. Parikh. Logical omniscience. In D. Leivant, editor, Logic and Computational Complexity, pages 22–29. Springer Springer Lecture Notes in Computer Science No. 960, 1995.
C. Parsons. On a number-theoretic choice schema and its relation to induction. In A. Kino, J. Myhill, and R.E. Vessley, editors, Intuitionism and Proof Theory, pages 459–473. North Holland, Amsterdam, 1970.
C. Parsons. On n-quantifier induction. The Journal of Symbolic Logic, 37(3):466–482, 1972.
A. Pitts. On an interpretation of second-order quantification in first order intuitionistic propositional logic. The Journal of Symbolic Logic, 57:33–52, 1992.
V. Plisko. The nonarithmeticity of the class of realizable predicate formulas. Soviet Mathematics Izvestia, 11:453–471, 1977.
W. Pohlers. Subsystems of set theory and second order number theory. In S.R. Buss, editor, Handbook of Proof Theory, pages 210–335. Elsevier, North-Holland, Amsterdam, 1998.
M.B. Pour-El and S. Kripke. Deduction-preserving “recursive isomorphisms” between theories. Fundamenta Mathematicae, 61:141–163, 1967.
M.O. Rabin. Non-standard models and independence of the induction axiom. In Essays on the Foundations of Mathematics: Dedicated to A. Fraenkel on his 70th anniversary, pages 287–299. North-Holland, Amsterdam, 1961.
H. Rasiowa and R. Sikorski. The Mathematics of Metamathematics. Polish Scientific Publishers, 1963.
Z. Ratajczyk. Functions provably total in I Σn. Fundamenta Mathematicae, 133:81–95, 1989.
M. Rathjen. Proof theory of reflection. Annals of Pure and Applied Logic, 68(2):181–224, 1994.
M. Rathjen. The realm of ordinal analysis. In S.B. Cooper and J.K. Truss, editors, Sets and proofs. London Math. Soc. Lect. Note Series 258, pages 219–279. Cambridge University Press, Cambridge, 1999.
B. Renne. Tableaux for the logic of proofs. Technical Report TR-2004001, CUNY Ph.D. Program in Computer Science, 2004.
H.E. Rose. Subrecursion: Functions and Hierarchies. Clarendon Press, Oxford, 1984.
J.B. Rosser. Extensions of some theorems of Gödel and Church. The Journal of Symbolic Logic, 1:87–91, 1936.
V.V. Rybakov. A criterion for admissibility of rules in the modal system S4 and intuitionistic logic. Algebra and Logic, 23:369–384, 1984.
V.V. Rybakov. On admissibility of the inference rules in the modal system G. In Yu.L. Ershov, editor, Trudy instituta matematiki, volume 12, pages 120–138. Nauka, Novosibirsk, 1989. In Russian.
V.V. Rybakov. Admissibility of logical inference rules. Elsevier, Amsterdam, 1997.
C. Ryll-Nardzewski. The role of the axiom of induction in elementary arithmetic. Fundamenta Mathematicae, 39:239–263, 1953.
G. Sambin and S. Valentini. The modal logic of provability, the sequential approach. Journal of Philosophic Logic, 11:311–342, 1982.
G. Sambin and S. Valentini. The modal logic of provability: cut-elimination. Journal of Philosophic Logic, 12:471–476, 1983.
U.R. Schmerl. A fine structure generated by reflection formulas over Primitive Recursive Arithmetic. In M. Boffa, D. van Dalen, and K. McAloon, editors, Logic Colloquium’78, pages 335–350. North Holland, Amsterdam, 1979.
K. Segerberg. An essay in classical modal logic. Filosofiska Föreningen och Filosofiska Insitutionen vid Uppsala Universitet, Uppsala, 1971.
S. Shapiro. Epistemic and intuitionistic arithmetic. In S. Shapiro, editor, Intensional Mathematics, pages 11–46. North-Holland, 1985.
S. Shapiro. Intensional mathematics and constructive mathematics. In S. Shapiro, editor, Intensional Mathematics, pages 1–10. North-Holland, 1985.
V.Yu. Shavrukov. The logic of relative interpretability over Peano arithmetic. Preprint, Steklov Mathematical Institute, Moscow, 1988. In Russian.
V.Yu. Shavrukov. On Rosser’s provability predicate. Zeitschrift f. math. Logik und Grundlagen d. Math., 37:317–330, 1991.
V.Yu. Shavrukov. A note on the diagonalizable algebras of PA and ZF. Annals of Pure and Applied Logic, 61:161–173, 1993.
V.Yu. Shavrukov. Subalgebras of diagonalizable algebras of theories containing arithmetic. Dissertationes Mathematicae, 323, 1993.
V.Yu. Shavrukov. A smart child of Peano’s. Notre Dame Journal of Formal Logic, 35:161–185, 1994.
V.Yu. Shavrukov. Isomorphisms of diagonalizable algebras. Theoria, 63(3):210–221, 1997.
V.Yu. Shavrukov. Undecidability in diagonalizable algebras. The Journal of Symbolic Logic, 62(1):79–116, 1997.
T. Sidon. Provability logic with operations on proofs. In S. Adian and A. Nerode, editors, Logical Foundations of Computer Science’ 97, Yaroslavl’, volume 1234 of Lecture Notes in Computer Science, pages 342–353. Springer, 1997.
T.L. Sidon. Craig interpolation property for operational logics of proofs. Vestnik Moskovskogo Universiteta. Ser. 1 Mat., Mech., (2):34–38, 1998. In Russian. English translation in: Moscow University Mathematics Bulletin, v.53, n.2, pp.37–41, 1999.
H. Simmons. Large discrete parts of the E-tree. The Journal of Symbolic Logic, 53:980–984, 1988.
T. Smiley. The logical basis of ethics. Acta Philosophica Fennica, 16:237–246, 1963.
C. Smoryński. Applications of Kripke models. In A. Troelstra, editor, Metamathematical investigations of intuitionistic arithmetic and analysis. Springer Lecture Notes 344, pages 324–391. Springer, Berlin, 1973.
C. Smoryński. ω-consistency and reflection. In Colloque International de Logique (Colloq. Int. CNRS), pages 167–181. CNRS Inst. B. Pascal, Paris, 1977.
C. Smoryński. The incompleteness theorems. In J. Barwise, editor, Handbook of Mathematical Logic, pages 821–865. North Holland, Amsterdam, 1977.
C. Smoryński. Beth’s theorem and self-referential sentences. In A. Macintyre et al., editor, Logic Colloquium’77. North Holland, Amsterdam, 1978.
C. Smoryński. Fifty years of self-reference. Notre Dame Journal of Formal Logic, 22:357–374, 1981.
C. Smoryński. The finite inseparability of the first order theory of diagonalizable algebras. Studia Logica, 41:347–349, 1982.
C. Smoryński. Self-Reference and Modal Logic. Springer-Verlag, Berlin, 1985.
C. Smoryński. Arithmetical analogues of McAloon’s unique Rosser sentences. Archive for Mathematical Logic, 28:1–21, 1989.
C. Smoryński. Modal logic and self-reference. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd ed., volume 11, pages 1–53. Springer, Berlin, 2004.
R.M. Solovay. Provability interpretations of modal logic. Israel Journal of Mathematics, 28:33–71, 1976.
R. Statman. Bounds for proof-search and speed-up in the predicate calculus. Annals of Mathematical Logic, 15:225–287, 1978.
G. Takeuti. Proof Theory. North-Holland, 1975.
A. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, Amsterdam, 1996.
A. Troelstra and D. van Dalen. Constructivism in Mathematics, vols 1, 2. North-Holland, Amsterdam, 1988.
A. Troelstra. Metamathematical investigations of intuitionistic arithmetic and analysis. Springer Lecture Notes 344. Springer-Verlag, Berlin, 1973.
A.S. Troelstra. Realizability. In S. Buss, editor, Handbook of Proof Theory, pages 407–474. Elsevier, 1998.
A.M. Turing. System of logics based on ordinals. Proc. London Math. Soc., ser. 2, 45:161–228, 1939.
V. Uspensky and V. Plisko. Intuitionistic Logic. Commentary on [Kolmogoroff, 1932] and [Kolmogorov, 1985]. In V.M. Tikhomirov, editor, Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, pages 394–404. Nauka, Moscow, 1985. In Russian, English translation in V.M. Tikhomirov, editor, Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, pages 452–466. Kluwer, Dordrecht 1991.
V.A. Uspensky. Kolmogorov and mathematical logic. Journal of Symbolic Logic, 57(2):385–412, 1992.
J. van Benthem. Reflections on epistemic logic. Logique & Analyse, 133-134:5–14, 1991.
J. van Benthem. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd ed., volume 3, pages 325–408. Kluwer, Dordrecht, 2001.
D. van Dalen. Intuitionistic logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic. Volume 3, pages 225–340. Reidel, 1986.
D. van Dalen. Logic and Structure. Springer-Verlag, 1994.
V.A. Vardanyan. Arithmetic comlexity of predicate logics of provability and their fragments. Doklady Akad. Nauk SSSR, 288(1):11–14, 1986. In Russian. English translation in Soviet Mathematics Doklady 33:569–572, 1986.
[Visser et al., 1995] A. Visser, J. van Benthem, D. de Jongh, and G. Renardel de Lavalette. NNIL, a study in intuitionistic propositional logic. In A. Ponse, M. de Rijke, and Y. Venema, editors, Modal Logic and Process Algebra, a bisimulation perspective. CSLI Lecture Notes, 53, pages 289–326. CSLI Publications, Stanford, 1995.
A. Visser. Numerations, λ-calculus and arithmetic. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry. Essays on combinatory logic, lambda-calculus and formalism, pages 259–284. Academic Press, London, 1980.
A. Visser. Aspects of Diagonalization and Provability. PhD thesis, University of Utrecht, Utrecht, The Netherlands, 1981.
A. Visser. On the completeness principle. Annals of Mathematical Logic, 22:263–295, 1982.
A. Visser. The provability logics of recursively enumerable theories extending Peano Arithmetic at arbitrary theories extending Peano Arithmetic. Journal of Philosophic Logic, 13:97–113, 1984.
A. Visser. Evaluation, provably deductive equivalence in Heyting arithmetic of substitution instances of propositional formulas. Logic Group Preprint Series 4, Department of Philosophy, University of Utrecht, 1985.
A. Visser. Peano’s smart children. A provability logical study of systems with built-in consistency. Notre Dame Journal of Formal Logic, 30:161–196, 1989.
A. Visser. Interpretability logic. In P.P. Petkov, editor, Mathematical Logic, pages 175–208. Plenum Press, New York, 1990.
A. Visser. The formalization of interpretability. Studia Logica, 50(1):81–106, 1991.
A. Visser. An inside view of EXP. the closed fragment of the provability logic of IΔ0 + Ω1 with a propositional constant for EXP. The Journal of Symbolic Logic, 57(1):131–165, 1992.
A. Visser. Propositional combinations of Σ1-sentences in Heyting’s arithmetic. Logic Group Preprint Series 117, Department of Philosophy, University of Utrecht, 1994.
A. Visser. A course in bimodal provability logic. Annals of Pure and Applied Logic, 73:109–142, 1995.
A. Visser. Uniform interpolation and layered bisimulation. In P. Hájek, editor, Lecture Notes in Logic 6. Logical foundations of Mathematics, Computer Science and Physics — Kurt Gödel’s Legacy, Gödel’ 96, Brno, Chech Republic, Proceedings, pages 139–164. Springer-Verlag, Berlin, 1996.
A. Visser. An overview of interpretability logic. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakhariaschev, editors, Advances in Modal Logic, v.1, CSLI Lecture Notes, No. 87, pages 307–359. CSLI Publications, Stanford, 1998.
A. Visser. Rules and arithmetics. Notre Dame Journal of Formal Logic, 40(1):116–140, 1999.
A. Visser. Faith and falsity. Logic Group Preprint Series 216, Department of Philosophy, University of Utrecht, 2002.
A. Visser. Substitutions of Σ 01 -sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic. Annals of Pure and Applied Logic, 114(1-3):227–271, 2002.
V. Švejdar. The decision problem of provability logic with only one atom. Archive for Mathematical Logic, 42(8):763–768, 2003.
S. Weinstein. The intended interpretation of intuitionistic logic. Journal of Philosophical Logic, 12:261–270, 1983.
[Wickline et al., 1998] P. Wickline, P. Lee, F. Pfenning, and R. Davies. Modal types as staging specifications for run-time code generation. ACM Computing Surveys, 30(3es), 1998.
A. Wilkie and J. Paris. On the scheme of induction for bounded arithmetic formulas. Annals of Pure and Applied Logic, 35:261–302, 1987.
F. Wolter. All finitely axiomatizable subframe logics containing CSM are decidable. Archive for Mathematical Logic, 37:167–182, 1998.
T. Yavorskaya (Sidon). Logic of proofs and provability. Annals of Pure and Applied Logic, 113(1-3):345–372, 2002.
R. Yavorsky. On the logic of the standard proof predicate. In Computer Science Logic 2000, volume 1862 of Lecture Notes in Computer Science, pages 527–541. Springer, 2000.
R. Yavorsky. Provability logics with quantifiers on proofs. Annals of Pure and Applied Logic, 113(1-3):373–387, 2002.
D. Zambella. Shavrukov’s theorem on the subalgebras of diagonalizable algebras for theories containing IΔ0 + exp. Notre Dame Journal of Formal Logic, 35:147–157, 1994.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this chapter
Cite this chapter
Artemov, S.N., Beklemishev, L.D. (2005). Provability Logic. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic, 2nd Edition. Handbook of Philosophical Logic, vol 13. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3521-7_3
Download citation
DOI: https://doi.org/10.1007/1-4020-3521-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3520-3
Online ISBN: 978-1-4020-3521-0
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)