References

For convenience, each reference item ends with a list of pages on which that item is cited.

Achilleos, Antonis. 2014a. A complexity question in justification logic. Journal of Computer and System Sciences, 80(6), 1038-1045.

Achilleos, Antonis. 2014b. On the complexity of two-agent Justification Logic. Pages 1-18 of: Bulling, N., van der Torre, L., Villata, S., Jamroga, W., and Vasconcelos, W. (eds.), Computational Logic in Multi-Agent Systems. CLIMA 2014. Lecture Notes in Computer Science, vol. 8624. Cham, Switzerland: Springer. pages xx

Achilleos, Antonis. 2015a. Interactions and Complexity in Multi-Agent Justification Logic. Ph.D. thesis, City University of New York. pages xx

Achilleos, Antonis. 2015b. Tableaux and complexity bounds for a multiagent Justi­fication Logic with interacting justifications. In: Bulling, N. (ed.), Multi-Agent Systems. Lecture Notes in Computer Science, vol. 8953. Cham, Switzerland: Springer. pages xx

Alt, Jesse, and Artemov, Sergei. 2001. Reflective T-calculus. Pages 22-37 of: Kahle, Reinhard, Schroeder-Heister, Peter, and Stark, Robert (eds.), Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Ger­many, October 7-12, 2001, Proceedings. Lecture Notes in Computer Science, vol. 2183. Berlin: Springer. pages xix

Antonakos, Evangelia. 2007. Justified and common knowledge: Limited conservativity. Pages 1-11 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4514. Springer. pages xx

Antonakos, Evangelia. 2013. Explicit generic common knowledge. Pages 16-28 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Sci­ence, International Symposium, LFCS 2013, San Diego, CA, USA, January 6­8, 2013, Proceedings.

Artemov, Sergei. 1994. LogicofProofs. Annals of Pure and Applied Logic, 67(1-3), 29-59. pages xviii

Artemov, Sergei. 1995. Operational Modal Logic. Tech. rept. MSI 95-29. Ithaca, NY: Cornell University Press. pages xiv, xv, xviii, xix, 7, 46, 75, 103, 139, 160, 161

Artemov, Sergei. 2001. Explicit provability and constructive semantics. Bulletin of Symbolic Logic, 7(1), 1-36. pages xiv, xv, xix, 7, 26, 46, 75, 139, 161, 181

Artemov, Sergei. 2002. Unified semantics for modality and d-terms via proof polyno­mials. Pages 89-118 of: Vermeulen, Kees, and Copestake, Ann (eds.), Algebras, Diagrams and Decisions in Language, Logic and Computation. CSLI Lecture Notes, vol. 144. Stanford: CSLI Publications. pages xix, xx

Artemov, Sergei. 2004. Kolmogorov and Godel's approach to intuitionistic logic: Cur­rent developments. Russian Mathematical Surveys, 59(2), 203-229. Originally published in Russian. pages xx

Artemov, Sergei. 2006. Justified common knowledge. Theoretical Computer Science, 357(1-3), 4-22. pages xix, xx, 46

Artemov, Sergei. 2008. The Logic of Justification. The Review of Symbolic Logic, 1(4), 477-513. pages xv, xvi, 46, 224

Artemov, Sergei. 2012. The ontology of justifications in the logical setting. Studia Logica, 100(1-2), 17-30. pages xv, 31, 44, 46, 51, 222

Artemov, Sergei. 2016a. Knowingthemodel. arXivpreprint arXiv:1610.04955. pages 231

Artemov, Sergei. 2016b. On aggregating probabilistic evidence. Pages 27-42 of: Arte- mov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4­7, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9537. Cham, Switzerland: Springer. pages xx

Artemov, Sergei. 2018. Justification awareness models. Pages 22-36 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, Inter­national Symposium, LFCS 2018, DeerfieldBeach, FL, USA, January 8-11, 2018, Proceedings.

Artemov, Sergei, and Bonelli, Eduardo. 2007. The Intensional Lambda calculus. Pages 12-25 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4514. Berlin: Springer. pages xix, xx

Artemov, Sergei, and Dzhaparidze, Giorgie. 1990. Finite Kripke models and predicate logics of provability. The Journal of Symbolic Logic, 55(3), 1090-1098. pages 220

Artemov, Sergei, and Fitting, Melvin. 2012. Justification Logic. In: Zalta, Edward N. (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Center for the Study of Language and Information, Stanford University. pages xv

Artemov, Sergei, and Kuznets, Roman. 2006. Logical omniscience via proof complex­ity. Pages 135-149 of: Esik, Zoltan (ed.), Computer Science Logic, 20th Inter­national Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings. Lecture Notes in Computer Sci­ence, vol. 4207. Berlin: Springer. pages xx

Artemov, Sergei, and Kuznets, Roman. 2009. Logical omniscience as a computational complexity problem. Pages 14-23 of: Heifetz, Aviad (ed.), Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009). Stanford University, California: ACM. pages xx

Artemov, Sergei, and Kuznets, Roman. 2014. Logical omniscience as infeasibility. Annals of Pure and Applied Logic, 165(1), 6-25. pages xx

Artemov, Sergei, and Nogina, Elena. 2005. Introducing justification into epistemic logic. Journal of Logic and Computation, 15(6), 1059-1073. pages 46

Artemov, Sergei, and Straβen, Tyko. 1992. The Basic Logic of Proofs. Tech. rept. IAM 92-018. Institute of Computer Science and Applied Mathematics, University of Bern. pages xviii

Artemov, Sergei, and Straβen, Tyko.

Artemov, Sergei, and Straβen, Tyko. 1993b. Functionality in the Basic Logic of Proofs. Tech. rept. IAM 93-004. Institute of Computer Science and Applied Mathematics, University of Bern. pages xviii

Artemov, Sergei, and Yavorskaya, Tatiana. 2001. On first order Logic of Proofs. Moscow Mathematical Journal, 1(4), 475-490. pages xix, 181

Artemov, Sergei, and Yavorskaya (Sidon), Tatiana. 2011. First-Order Logic of Proofs. Tech. rept. TR-2011005. City University of New York. pages xvii, xix, 181, 212, 221

Artemov, Sergei, Kazakov, E., and Shapiro, D. 1999. Logic of Knowledge with Justifi­cations. Tech. rept. CFIS 99-12. Ithaca, NY: Cornell University Press. pages xx, 29, 139

Baltag, Alexandru, Renne, Bryan, and Smets, Sonja. 2014. The logic of justified belief, explicit knowledge, and conclusive evidence. Annals of Pure and Applied Logic, 165(1), 49-81. pages xx

Blackburn, Patrick, de Rijke, Maarten, and Venema, Yde. 2001. Modal Logic. Cam­bridge, UK: Cambridge University Press. pages 29, 57

Borg, Annemarie, and Kuznets, Roman. 2015. Realization theorems for Justification Logics: Full modularity. Pages 221-236 of: De Nivelle, Hans (ed.), Automated Reasoning with Analytic Tableaux and Related Methods. Cham, Switzerland: Springer Lecture Notes in Computer Science, vol. 9323. TABLEAUX 2015. pages 140

Brezhnev, Vladimir N. 2000. On Explicit Counterparts of Modal Logics. Tech. rept. CFIS 2000-05. Ithaca, NY: Cornell University Press. pages 139

Brezhnev, Vladimir N., and Kuznets, Roman. 2006. Making knowledge explicit: How hard it is. Theoretical Computer Science, 357(1-3), 23-34. pages xix, 108, 139, 180

Bucheli, Samuel. 2012. Justification Logics with Common Knowledge.

Bucheli, Samuel, Kuznets, Roman, and Studer, Thomas. 2010. Two ways to common knowledge. Pages 83-98 of: Bolander, Thomas, and Brauner, Torben (eds.), Pro­ceedings of the 6th Workshop on Methods for Modalities (M4M-6 2009), Copen­hagen, Denmark, 12-14 November 2009. Electronic Notes in Theoretical Com­puter Science, no. 262. Amsterdam: Elsevier. pages xx

Bucheli, Samuel, Kuznets, Roman, and Studer, Thomas. 2011. Justifications for com­mon knowledge. Journal of Applied Non-Classical Logics, 21(1), 35-60. pages xx

Buss, Samuel R., and Kuznets, Roman. 2012. Lower complexity bounds in Justification Logic. Annals of Pure and Applied Logic, 163(7), 888-905. pages xix

Chellas, Brian F. 1980. Modal Logic, an Introduction. Cambridge, UK: Cambridge University Press. pages 27, 55, 143, 145, 146

Cresswell, Max J. 1975. Hyperintensional logic. Studia Logica, 34(1), 25-38. pages 8 Dean, Walter, and Kurokawa, Hidenori. 2010. From the Knowability Paradox to the existence of proofs. Synthese, 176(2), 177-225. pages xx

Dean, Walter, and Kurokawa, Hidenori. 2016. Kreisel's theory of constructions, the Kreisel-Goodman paradox, and the second clause. In: Piecha, Thomas, and Schroeder-Heister, Peter (eds.), Advances in Proof-Theoretic Semantics. Trends in Logic (Studia Logica Library), vol. 43. Cham, Switzerland: Springer. pages 175, 179, 190

Dretske, Fred. 2005. Is knowledge closed under known entailment? The case against closure. Pages 13-26 of: Steup, M., and Sosa, E. (eds.), Contemporary Debates in Epistemology. Malden, MA: Blackwell. pages 2

Ershov, Yu. L., and Palyutin, E. A. 1984. Mathematical Logic. “Mir”, Moscow. Trans­lated from the Russian by Vladimir Shokurov. pages 220

Fagin, Ronald, and Halpern, Joseph Y. 1988. Belief, awareness, and limited reasoning. Artificial Intelligence, 34, 39-76. pages 9, 223

Fagin, Ronald, Halpern, Joseph Y., Moses, Yoram, and Vardi, Moshe Y. 1995. Rea­soning about Knowledge. Cambridge, MA: MIT Press.

Feferman, Solomon, Dawson Jr., John W., Kleene, Stephen C., Moore, Gregory H., Solovay, Robert M., van Heijenoort, Jean, Goldfarb, Warren D., Parsons, Charles, and Sieg, Wilfried (eds.). 1986-2003. Kurt Godel Collected Works. Oxford, UK: Oxford. Five volumes. pages

Fitting, Melvin. 1996. First-Order Logic and Automated Theorem Proving. New York: Springer-Verlag. First edition, 1990. Errata at http://melvinfltting.org/ errata/errata.html. pages 87

Fitting, Melvin. 1999. A simple propositional S5 tableau system. Annals of Pure and Applied Logic, 96, 107-115. Originally in The Parikh Project, Seven papers in honour of Rohit, Uppsala Prints and Reprints in Philosophy, 1996 Number 18. pages 139

Fitting, Melvin. 2003. A Semantics for the Logic of Proofs. Tech. rept. TR-2003012. Ph.D. Program in Computer Science. City University of New York. pages xix, 31, 48,51, 139

Fitting, Melvin. 2005. The Logic of Proofs, semantically. Annals of Pure and Applied Logic, 132, 1-25. pages xv, xvi, xix, 31, 46, 48, 51, 62, 111, 112, 120, 136, 139, 224

Fitting, Melvin. 2009. Realizations and LP. Annals of Pure and Applied Logic, 161(3), 368-387. pages 93, 140

Fitting, Melvin. 2010. Justification Logics and hybrid logics. Journal of Applied Logic, 8(4), 356-370. pages 120, 139

Fitting, Melvin. 2011a. Possible World Semantics for First Order LP. Tech. rept. TR- 2011010. City University of New York. pages xvii

Fitting, Melvin. 2011b. The Realization Theorem for S5, A simple, constructive proof. Chap. 4, pages 61-76 of: van Benthem, Johan, Gupta, Amitabha, and Pacuit, Eric (eds.), Games, Norms and Reasons. Synthese Library. New York: Springer. pages 139

Fitting, Melvin. 2013a. Realization Implemented. Tech. rept. TR-2013005. City Uni­versity of New York. pages 93, 139

Fitting, Melvin. 2013b. Realization using the model existence theorem. Journal of Logic and Computation. pages 93, 111, 140

Fitting, Melvin. 2014a. Justification Logics and Realization. Tech. rept. TR-2014004. Ph.D. Program in Computer Science. City University of New York. pages xix, 112, 136, 139

Fitting, Melvin. 2014b. Possible world semantics for ArstorderLogicofProofs. Annals of Pure and Applied Logic, 165, 225-240. pages xvii

Fitting, Melvin. 2015. Cut-free proof systems for Geach logics. IfCoLog Journal of Logics and their Applications, 2(2), 17-64. pages xvi

Fitting, Melvin. 2016a. Modal logics, justification logics, and realization. Annals of Pure and Applied Logic, 167, 615-648. pages xvi, 46, 112, 136

Fitting, Melvin. 2016b. Quasi-Realization. Pages 313-332 of: Hansen, Helle Hvid, Murray, Sarah E., Sadrzadeh, Mehrnoosh, and Zeevat, Henk (eds.), Logic, Lan­guage, and Computation. Lecture Notes in Computer Science, vol. 10148. New York: Springer. 11th International Tbilisi Symposium, TbiLLC, Tbilisi, Georgia, September 21-26, 2015. pages 112

Fitting, Melvin C. 2017. Paraconsistent logic, evidence, and justification. Studia Log- ica, 105(6), 1149-1166. Special Issue: 40 Years of FDE. pages 30

Fitting, Melvin C., and Salvatore, Felipe. 2018. First-order justification logic with constant domain semantics. To appear in Annals of Pure and Applied Logic. pages xvii, xix, 181

Gabbay, Dov M. 1994. Labeled Deductive Systems. Oxford, UK: Oxford University Press. pages xv

Geach, Peter. 1973. On Certain modal systems connected with S4.3. Bulletin of the Section of Logic, 2, 8-11. pages 29

Gettier, Edmund. 1963. Is knowledge justified true belief? Analysis, 23(6), 121-123. pages 1, 24

Ghari, Meghdad. 2012. Cut elimination and realization for epistemic logics with justi­fication. Journal of Logic and Computation, 22(5), 1171-1198. pages xix

Ghari, Meghdad. 2014. Tableau proof systems for Justification Logics. arXiv, preprint arXiv:1405.1828(May). pages xix

Ghari, Meghdad. 2016a. Analytic tableaux for justification logics. arXiv, preprint arXiv:1606.03562. pages xix

Ghari, Meghdad. 2016b. Pavelka-style fuzzy justification logics. Logic Journal of the IGPL, 24(5), 743-773. pages xx

Ghari, Meghdad. 2017. Labeled sequent calculus for justification logics. Annals of Pure and Applied Logic, 168(1), 72-111. pages xix

Girard, J.-Y., Lafont, Y., and Taylor, P. 1989. Proofs and Types. Cambridge, UK: Cambridge University Press. pages 7

Godel, Kurt. 1933. EineInterpretationdes intuistionistischen Aussagenkalkuls. Ergeb- nisse eines mathematischen Kolloquiums, 4, 39-40. Translated as An interpre­tation of the intuitionistic propositional calculus in Feferman et al. (1986-2003) I, 296-301. Kurt Godel Collected Works. Oxford, UK: Oxford University Press. pages xii, 5, 6, 175

Godel, Kurt. 1938. Vortrag bei Zilsel. Translated as Lecture at Zilsel's in Feferman etal. (1986-2003) III, 62-113. Kurt Godel Collected Works. Oxford, UK: Oxford University Press. pages xiv, xvii, 6, 175

Goodman, N. D. 1970. A theory of constructions is equivalent to arithmetic. Pages 101-120 of: Myhill, J., Kino, A., and Vesley, R. E. (eds.), Intuitionism and Proof Theory. Amsterdam: North-Holland. pages 7

Goris, Evan. 2008. Feasible operations on proofs: The Logic of Proofs for Bounded Arithmetic. Theory of Computing Systems, 43(2), 185-203. pages xix

Hendricks, Vincent F. 2005. Mainstream and Formal Epistemology. Cambridge, UK: Cambridge University Press. pages 1

Heyting, Arend. 1934. Mathematische Grundlagenforschung. Intuitionismus. Beweis- theorie. Berlin: Springer-Verlag. pages 4

Hintikka, Jaakko. 1962. Knowledge and Belief: An Introduction to the Logic of the Two Notions. Ithaca, NY: Cornell University Press. pages 1

Kazakov, E. L. 1999. Logics of Proofs for S5. M.Phil. thesis, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics. In Russian. pages 139

Kleene, Stephen C. 1945. On the Interpretation of intuitionistic number theory. Journal of Symbolic Logic, 10(4), 109-124. pages 175

Kokkinis, Ioannis, OgnjanoviC, Zoran, and Studer, Thomas. 2016. Probabilistic justifi­cation logic. Pages 174-186 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2016, Deer­field Beach, FL, USA, January 4-7, 2016, Proceedings. Lecture Notes in Com­puter Science, vol. 9537. New York: Springer. pages xx

Kolmogoroff, A. 1932. Zur Deutung der intuitionistischen Logik. Mathematische Zeitschrift, 35, 58-65. In German. English translation in V. M. Tikhomirov (ed.), Selected works ofA.N. Kolmogorov. Volume I: Mathematics and Mechanics, pages 151-158. Dordrecht: Kluwer, 1991. pages 4, 5

Kreisel, G. 1962. Foundations of Intuitionistic Logic. Pages 198-210 of: Nagel, E., Suppes, P., and Tarski, A. (eds.), Logic, Methodology and Philosophy of Science. Proceedings of the 1960 International Congress. Stanford, CA: Stanford Univer­sity Press. pages 7, 175, 179, 190

Kreisel, G. 1965. Mathematical Logic. Pages 95-195 of: Saaty, T. L. (ed.), Lectures in Modern Mathematics III. New York: Wiley and Sons. pages 7

Krupski, Nikolai V. 2006a. On the complexity of the reflected Logic of Proofs. Theo­retical Computer Science, 357(1-3), 136-142. pages xix

Krupski, Nikolai V. 2006b. Typing in reflective combinatory logic. Annals of Pure and AppliedLogic, 141(1-2), 243-256. pages xx

Krupski, Vladimir N. 1997. Operational logic of proofs with functionality condition on proof predicate. Pages 167-177 of: Adian, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, LFCS'97, Yaroslav, Russia. Lecture Notes in Computer Science, vol. 1234. New York: Springer. pages xviii, 160, 222

Krupski, VladimirN. 2001. The single-conclusion proof logic and inference rules spec­ification. Annals of Pure and AppliedLogic, 113(1-3), 181-206. pages xviii, 222

Krupski, Vladimir N. 2018. On the sharpness and the single-conclusion property of basic justification models. Pages 211-220 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings. Lec­ture Notes in Computer Science, vol. 10703. New York: Springer. pages xviii

Kurokawa, Hidenori. 2009. Tableaux and hypersequents for Justification Logic. Pages 295-308 of: Artemov, Sergei [N.], and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings. Lecture Notes in Computer Science, vol. 5407. New York: Springer. Later version published as Kurokawa (2012). pages xix

Kurokawa, Hidenori. 2012. Tableaux and hypersequents for Justification Logics. An­nals of Pure and Applied Logic, 163(7), 831-853. pages xix, 239

Kurokawa, Hidenori. 2013. Prefixed tableau systems for Logic of Proofs and prov­ability. Pages 203-218 of: Galmiche, D., and Larchey-Wendling, D. (eds.), TABLEAUX 2013, Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science, vol. 8123. Berlin, Heidelberg: Springer. pages xix

Kuznets, Roman. 2000. On the complexity of explicit modal logics. Pages 371-383 of: Clote, Peter G., and Schwichtenberg, Helmut (eds.), Computer Science Logic, 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Fis­chbachau, Germany, August 21-26, 2000, Proceedings. Lecture Notes in Com­puter Science, vol. 1862. New York: Springer. Errata concerning the explicit counterparts of D and D4 are published as Kuznets (2009). pages xix, 46

Kuznets, Roman. 2009. Complexity through tableaux in justification logic. Page 121 of: 2008 European Summer Meeting of the Associationfor Symbolic Logic, Logic Colloquium ’08, Bern, Switzerland, July 3-July 8, 2008. Bulletin of Symbolic Logic, vol. 15(1). Poughkeepsie, NY: Association for Symbolic Logic. pages 180, 240

Kuznets, Roman, and Goetschi, Remo. 2012. Realization for justification logics via nested sequents: Modularity through embedding. Annals of Pure and Applied Logic, 163(9), 1271-1298. pages xvi, 44, 46, 51, 140

Kuznets, Roman, and Studer, Thomas. 2012. Justifications, ontology, and conservativ- ity. Pages 437-458 of: Bolander, Thomas, Brauner, Torben, Ghilardi, Silvio, and Moss, Lawrence (eds.), Advances in Modal Logic, Volume 9. College Publica­tions. pages 31, 222

Kuznets, Roman, and Studer, Thomas. 2016. Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of the IGPL, 24(3), 424-440. pages xix

Lemmon, E. J., and Scott, Dana S. 1977. The “Lemmon Notes”: An Introduction to Modal Logic. Amer. Phil. Quart., Monograph 11, Oxford. Blackwell. edited by Krister Segerberg. pages 142

Lewis, C. I. 1918. A Survey of Symbolic Logic. Berkeley: University of California Press. pages xiii

Lewis, C. I., and Langford, C. H. 1932. Symbolic Logic. Second edition 1959, Dover (New York) edn. London: Century. pages xiii

Lurie, Joseph. 2018. Probabilistic justification logic. Philosophies, 3(1), 2. pages xx

McKinsey, J. C. C., and Tarski, A. 1948. Some theorems about the sentential calculi of Lewis and Heyting. The Journal of Symbolic Logic, 13, 1-15. pages 6

Meyer, J.-J. Ch., and van der Hoek, W. 1995. Epistemic Logic for AI and Computer Science. Cambridge, UK: Cambridge University Press. pages 223

Milnikel, Robert [S.]. 2007. Derivability in certain subsystems of the Logic of Proofs is ∏p-complete. Annals of Pure and Applied Logic, 145(3), 223-239. pages xix

Milnikel, Robert S. 2014. The logic of uncertain justifications. Annals of Pure and Applied Logic, 165(1), 305-315. pages xx

Mkrtychev, Alexey. 1997. Models for the Logic of Proofs. Pages 266-275 of: Adian, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, 4th International Symposium, LFCS’97, Yaroslavl, Russia, July 6-12, 1997, Proceed­ings. Lecture Notes in Computer Science, vol. 1234. New York: Springer. pages xv, xix, 31, 40, 46, 49

Negri, Sara. 2005. Proof analysis in modal logic. Journal of Philosophical Logic, 34, 507-544. pages xvi

Negri, Sara, and von Plato, Jan. 2001. Structural ProofTheory. Paperback edition 2008 edn. Cambridge, UK: Cambridge University Press. pages xvi

Nogina, Elena. 2006. On Logic of Proofs and provability. Bulletin of Symbolic Logic, 12(2), 356. pages xviii

Nogina, Elena. 2014a. On a hierarchy of reflection principles in Peano arithmetic. arXiv preprint arXiv:1405.2558. pages xviii

Nogina, Elena. 2014b. On Logic of formal provability and explicit proofs. arXiv preprint arXiv:1405.2559. pages xviii

Pacuit, Eric. 2005. A Note on some explicit modal logics. Pages 117-125 of: Dimi- tracopoulos, Costas (ed.), Proceedings of the Fifth Panhellenic Logic Symposium. pages xvi, 28, 56, 139, 241

Pacuit, Eric. 2006. A Note on Some Explicit Modal Logics. Tech. rept. PP-2006- 29. Institute for Logic, Language and Computation, University of Amsterdam. Published as Pacuit (2005). pages 28, 46, 56, 139

Pouliasis, Konstantinos, and Primiero, Giuseppe. 2014. J-Calc: A typed lambda calcu­lus for Intuitionistic Justification Logic. Electronic Notes in Theoretical Computer Science, 300, 71-87. pages xx

Protopopescu, Tudor. 2016a. An arithmetical interpretation of verification and intu­itionistic knowledge. Pages 317-330 of: Artemov, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9537. New York: Springer. pages xx

Protopopescu, Tudor. 2016b. An arithmetical interpretation of verification and intu- itionistic knowledge. arXivpreprint arXiv:1601.03059. pages xx

Renne, Bryan. 2004 (Mar.). Tableauxfor the Logic of Proofs. Tech. rept. TR-2004001. Ph.D. Program in Computer Science. City University of New York. pages xix

Renne, Bryan. 2006. Semantic cut-elimination for two explicit modal logics. In: Huitink, J., and Katrenko, S. (eds.), Proceedings of the Eleventh ESSLLI Student Session. pages xix

Renne, Bryan. 2008. Dynamic Epistemic Logic with Justification. Ph.D. thesis. City University of New York. pages xx

Rose, GeneF. 1953. Propositionalcalculusandrealizability. Transactions of the Amer­ican Mathematical Society, 75(1), 1-19. pages 7

Rubtsova, Natalia M. 2006a. Evidence reconstruction of epistemic modal logic S5. Pages 313-321 of: Grigoriev, Dima, Harrison, John, and Hirsch, Edward A. (eds.), Computer Science - Theory and Application, First International Computer Sci­ence Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings. Lecture Notes in Computer Science, vol. 3967. New York: Springer. pages xvi, 51, 52, 56

Rubtsova, Natalia M. 2006b. On realization of S5-modality by evidence terms. Journal of Logic and Computation, 16(5), 671-684. pages xvi, 28, 46, 56, 139

Russell, Bertrand. 2001. The Problems of Philosophy. Oxford, UK: Oxford University Press. pages 224

Schwichtenberg, Helmut. Fermat last theorem example. Personal communication. pages 190

Sedldr, Igor. 2013. Justifications, awareness and epistemic dynamics. Pages 307-318 of: Artemov, Sergei [N.], and Nerode, Anil (eds.), Logical Foundations of Com­puter Science, International Symposium, LFCS 2013, San Diego, CA, USA, Jan­uary 6-8, 2013, Proceedings. Lecture Notes in Computer Science, vol. 7734. New York: Springer. pages xx, 9

Shamkanov, Daniyar S. 2011. Strong normalization and confluence for reflexive combi­natory logic. Pages 228-238 of: Beklemishev, Lev D., and de Queiroz, Ruy (eds.), Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011, Proceedings. Lecture Notes in Artificial Intelligence, vol. 6642. New York: Springer. pages xx

Shamkanov, Daniyar S. 2016. A Realization theorem for the Godel-Lob provability logic. Sbornik: Mathematics, 207(9), 1344. pages 62

Sidon, Tatiana L. 1997. Provability logic with operations on proofs. Pages 342-353 of: Adian, Sergei, and Nerode, Anil (eds.), Logical Foundations of Computer Sci­ence, LFCS'97, Yaroslavl, Russia. Lecture Notes in Computer Science, vol. 1234. New York: Springer. pages xviii, 160

Smorynski, Craig. 1985. Self-Reference and Modal Logic. NewYork: Springer-Verlag. pages 158, 214

Smullyan, Raymond M. 1963. A Unifying principle in quantification theory. Proceed­ings of the National Academy of Sciences, 49(6), 828-832. pages 87

Smullyan, Raymond M. 1968. First-OrderLogic. Berlin: Springer-Verlag. (Revised Edition, New York: Dover Press, 1994). pages 87, 96

Solovay, Robert M. 1976. Provability interpretation of modal logic. Israel Journal of Mathematics, 25, 287-304. pages xiii

Takeuti, Gaisi. 1975. ProofTheory. Amsterdam: North-Holland. SecondEdition, New York: Dover Publications, 2013. pages 158

Troelstra, Anne Sjerp. 1998. Realizability. Pages 407-474 of: Buss, S. (ed.), Handbook of Proof Theory. Amsterdam: Elsevier. pages 7

Troelstra, Anne Sjerp, and Schwichtenberg, Helmut. 1996. Basic Proof Theory. Ams­terdam: Cambridge University Press. Second Edition 2000. pages 7, 187, 188

Troelstra, Anne Sjerp, and van Dalen, Dirk. 1988. Constructivism in Mathematics. Vol. I. Studies in Logic and the Foundations of Mathematics, 26. Amsterdam: North-Holland. pages 4

Twain, Mark. 1896. Personal Recollections of Joan of Arc. New York: Harper & Brothers. Real name: Samuel Langhorne Clemens. pages xxi

van Ditmarsch, Hans, van Der Hoek, Wiebe, and Kooi, Barteld. 2007. Dynamic Epis- temic Logic. Vol. 337. Berlin: Springer Science & Business Media. pages 1

von Wright, Georg Henrik. 1951. An Essay in Modal Logic. Amsterdam: North- Holland. pages 1

Wang, Ren-June. 2011a. Knowledge, time, and the problem of logical omniscience. Fundamenta Informaticae, 106(2-4), 321-338. pages xx

Wang, Ren-June. 2011b. Non-Circular proofs and proof realization in modal logic. Tech. rept. TR-2011012. City University of New York. pages 156

Wang, Ren-June. 2014. Non-circular proofs and proof realization in modal logic. An­nals of Pure and Applied Logic, 165(7-8), 1318-1338. pages 156

Ward, Artemus. 1861. Moses, the Sassy; or, the Disguised Duke. Vanity Fair, June 15. Real name: Charles Farrar Browne. pages x

Williamson, Timothy. 2015. A note on Gettier cases in epistemic logic. Philosophical Studies, 172(1), 129-140. pages 224

Yavorskaya (Sidon), Tatiana. 2001. Logic of Proofs and provability. Annals of Pure and Applied Logic, 113(1-3), 345-372. pages xviii

Yavorskaya (Sidon), Tatiana. 2008. Interacting Explicit Evidence Systems. Theory of Computing Systems, 43(2), 272-293. pages xx

Yavorsky, Rostislav. 2001. Provability logics with quantifiers on proofs. Annals of Pure and Applied Logic, 113(1-3), 373-387. pages xix

Yu, Junhua. 2014. Self-referentiality of Brouwer-Heyting-Kolmogorov semantics. An­nals of Pure and Applied Logic, 165(1), 371-388. pages 180