Linked bibliography for the SEP article "Justification Logic" by Sergei Artemov and Melvin Fitting

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

  • Antonakos, E. (2007). “Justified and Common Knowledge: Limited Conservativity”, in S. Artemov and A. Nerode (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings (Lecture Notes in Computer Science: Volume 4514), Berlin: Springer, pp. 1–11. (Scholar)
  • Arlo-Costa, H. and K. Kishida (2009). “Three proofs and the Knower in the Quantified Logic of Proofs”, in Formal Epistemology Workshop / FEW 2009. Proceedings, Carnegie Mellon University, Pittsburgh, PA, USA. (Scholar)
  • Artemov, S. (1995). “Operational modal logic”, Technical Report MSI 95–29, Cornell University. (Scholar)
  • –––. (2001). “Explicit provability and constructive semantics”, The Bulletin of Symbolic Logic, 7(1): 1–36. (Scholar)
  • –––. (2006). “Justified common knowledge”, Theoretical Computer Science, 357 (1–3): 4–22. (Scholar)
  • –––. (2008). “The logic of justification”, The Review of Symbolic Logic, 1(4): 477–513. (Scholar)
  • ––– (2012). “The Ontology of Justifications in the Logical Setting.” Studia Logica 100 (1–2): 17–30. (Scholar)
  • Artemov, S. and R. Kuznets (2009). “Logical omniscience as a computational complexity problem”, in A. Heifetz (ed.), Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009), ACM Publishers, pp. 14–23. (Scholar)
  • Artemov, S. and E. Nogina (2005). “Introducing justification into epistemic logic”, Journal of Logic and Computation, 15(6): 1059–1073. (Scholar)
  • Artemov, S. and T. Yavorskaya (Sidon) (2001). “On first-order logic of proofs”, Moscow Mathematical Journal, 1(4): 475–490. (Scholar)
  • ––– (2011). “First-Order Logic of Proofs.” TR–2011005, City University of New York, Ph.D. Program in Computer Science. (Scholar)
  • Boolos, G. (1993). The Logic of Provability, Cambridge: Cambridge University Press. (Scholar)
  • Brezhnev, V. (2001). “On the logic of proofs”, in K. Striegnitz (ed.), Proceedings of the Sixth ESSLLI Student Session, 13th European Summer School in Logic, Language and Information (ESSLLI’01), pp. 35–46. (Scholar)
  • Brezhnev, V. and R. Kuznets (2006). “Making knowledge explicit: How hard it is”, Theoretical Computer Science, 357 (1–3): 23–34. (Scholar)
  • Cubitt, R. P. and R. Sugden (2003). “Common knowledge, salience and convention: A reconstruction of David Lewis’ game theory”, Economics and Philosophy, 19: 175–210. (Scholar)
  • Dean, W. and H. Kurokawa (2009a). “From the Knowability Paradox to the existence of proofs”, Synthese, 176(2): 177–225. (Scholar)
  • –––. (2009b). “Knowledge, proof and the Knower”, in A. Heifetz (ed.), Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009), ACM Publications, pp. 81–90. (Scholar)
  • Dretske, F. (2005). “Is Knowledge Closed Under Known Entailment? The Case against Closure”, in M. Steup and E. Sosa (eds.), Contemporary Debates in Epistemology, Oxford: Blackwell, pp. 13–26. (Scholar)
  • Fagin, R., and J. Y. Halpern. 1988. “Belief, Awareness, and Limited Reasoning.” Artificial Intelligence 34: 39–76. (Scholar)
  • Fagin, R., J. Halpern, Y. Moses, and M. Vardi (1995). Reasoning About Knowledge, Cambridge, MA: MIT Press. (Scholar)
  • Fitting, M. (2005). “The logic of proofs, semantically”, Annals of Pure and Applied Logic, 132(1): 1–25. (Scholar)
  • –––. (2006). “A replacement theorem for \(\mathbf{LP}\)”, Technical Report TR-2006002, Department of Computer Science, City University of New York.
  • –––. (2008). “A quantified logic of evidence”, Annals of Pure and Applied Logic, 152(1–3): 67–83.
  • –––. (2009). “Realizations and \(\mathbf{LP}\)”, Annals of Pure and Applied Logic, 161(3): 368–387. (Scholar)
  • ––– (2014a). “Possible World Semantics for First Order Logic of Proofs.” Annals of Pure and Applied Logic 165: 225–40. (Scholar)
  • ––– (2014b). “Justification Logics and Realization.” TR-2014004, City University of New York, Ph.D. Program in Computer Science. (Scholar)
  • Gettier, E. (1963). “Is Justified True Belief Knowledge?Analysis, 23: 121–123. (Scholar)
  • Girard, J.-Y., P. Taylor, and Y. Lafont (1989). Proofs and Types (Cambridge Tracts in Computer Science: Volume 7), Cambridge: Cambridge University Press. (Scholar)
  • Gödel, K. (1933). “Eine Interpretation des intuitionistischen Aussagenkalkuls”, Ergebnisse Math. Kolloq., 4: 39–40. English translation in: S. Feferman et al. (eds.), Kurt Gödel Collected Works (Volume 1), Oxford and New York: Oxford University Press and Clarendon Press, 1986, pp. 301–303. (Scholar)
  • –––. (1938). “Vortrag bei Zilsel/Lecture at Zilsel’s” (*1938a), in S. Feferman, J. J. Dawson, W. Goldfarb, C. Parsons, and R. Solovay (eds.), Unpublished Essays and Lectures (Kurt Gödel Collected Works: Volume III), Oxford: Oxford University Press, 1995, pp. 86–113. (Scholar)
  • Goldman, A. (1967). “A causal theory of meaning”, The Journal of Philosophy, 64: 335–372.
  • Goodman, N. (1970). “A theory of constructions is equivalent to arithmetic”, in J. Myhill, A. Kino, and R. Vesley (eds.), Intuitionism and Proof Theory, Amsterdam: North-Holland, pp. 101–120.
  • Goris, E. (2007). “Explicit proofs in formal provability logic”, in S. Artemov and A. Nerode (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings (ecture Notes in Computer Science: Volume 4514), Berlin: Springer, pp. 241–253. (Scholar)
  • Hendricks, V. (2005). Mainstream and Formal Epistemology, New York: Cambridge University Press. (Scholar)
  • Heyting, A. (1934). Mathematische Grundlagenforschung. Intuitionismus. Beweistheorie, Berlin: Springer. (Scholar)
  • Hintikka, J. (1962). Knowledge and Belief, Ithaca: Cornell University Press. (Scholar)
  • Kleene, S. (1945). “On the interpretation of intuitionistic number theory”, The Journal of Symbolic Logic, 10(4): 109–124. (Scholar)
  • Kolmogorov, A. (1932). “Zur Deutung der Intuitionistischen Logik”, Mathematische Zeitschrift, 35: 58–65. English translation in V.M. Tikhomirov (ed.), Selected works of A.N. Kolmogorov. Volume I: Mathematics and Mechanics, Dordrecht: Kluwer, 1991, pp. 151–158. (Scholar)
  • Kreisel, G. (1962). “Foundations of intuitionistic logic”, in E. Nagel, P. Suppes, and A. Tarski (eds.), Logic, Methodology and Philosophy of Science. Proceedings of the 1960 International Congress, Stanford: Stanford University Press, pp. 198–210. (Scholar)
  • –––. (1965). “Mathematical logic”, in T. Saaty (ed.), Lectures in Modern Mathematics III, New York: Wiley and Sons, pp. 95–195. (Scholar)
  • Krupski, V. (1997). “Operational logic of proofs with functionality condition on proof predicate”, in S. Adian and A. Nerode (eds.), Logical Foundations of Computer Science, 4th International Symposium, LFCS’97, Yaroslavl, Russia, July 6–12, 1997, Proceedings (Lecture Notes in Computer Science: Volume 1234), Berlin: Springer, pp. 167–177. (Scholar)
  • Kurokawa, H. (2009). “Tableaux and Hypersequents for Justification Logic”, in S. Artemov and A. Nerode (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3–6, 2009, Proceedings (Lecture Notes in Computer Science: Volume 5407), Berlin: Springer, pp. 295–308. (Scholar)
  • Kuznets, R. (2000). “On the Complexity of Explicit Modal Logics”, in P. Clote and H. Schwichtenberg (eds.), Computer Science Logic, 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Fischbachau, Germany, August 21–26, 2000, Proceedings (Lecture Notes in Computer Science: Volume 1862), Berlin: Springer, pp. 371–383. (Scholar)
  • –––. (2008). Complexity Issues in Justification Logic, Ph. D. dissertation, Computer Science Department, City University of New York Graduate Center. (Scholar)
  • –––. (2010). “A note on the abnormality of realizations of S4LP”, in K. Brünnler and T. Studer (eds.), Proof, Computation, Complexity PCC 2010, International Workshop, Proceedings, IAM Technical Reports IAM-10-001, Institute of Computer Science and Applied Mathematics, University of Bern.
  • Kuznets, Roman, and Thomas Studer. 2012. “Justifications, Ontology, and Conservativity.” In Advances in Modal Logic, Volume 9, edited by Thomas Bolander, Torben Braüner, Silvio Ghilardi, and Lawrence Moss, 437–58. College Publications. (Scholar)
  • Lemmon, E. J., and Dana S. Scott. 1977. The “Lemmon Notes”: An Introduction to Modal Logic. Amer. Phil. Quart., Monograph 11, Oxford. Blackwell. (Scholar)
  • McCarthy, J., M. Sato, T. Hayashi, and S. Igarishi (1978). “On the model theory of knowledge”, Technical Report STAN-CS-78-667, Department of Computer Science, Stanford University. (Scholar)
  • Milnikel, R. (2007). “Derivability in certain subsystems of the Logic of Proofs is \(\Pi _{2}^{p}\)-complete”, Annals of Pure and Applied Logic, 145(3): 223–239. (Scholar)
  • –––. (2009). “Conservativity for Logics of Justified Belief”, in S. Artemov and A. Nerode (eds.), Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3–6, 2009, Proceedings (Lecture Notes in Computer Science: Volume 5407), Berlin: Springer, pp. 354–364. (Scholar)
  • Mkrtychev, A. (1997). “Models for the Logic of Proofs”, in S. Adian and A. Nerode (eds.), Logical Foundations of Computer Science, 4th International Symposium, LFCS’97, Yaroslavl, Russia, July 6–12, 1997, Proceedings (Lecture Notes in Computer Science: Volume 1234), Berlin: Springer, pp. 266–275. (Scholar)
  • Nogina, E. (2006). “On logic of proofs and provability”, in 2005 Summer Meeting of the Association for Symbolic Logic, Logic Colloquium’05, Athens, Greece (July 28–August 3, 2005), The Bulletin of Symbolic Logic, 12(2): 356. (Scholar)
  • –––. (2007). “Epistemic completeness of GLA”, in 2007 Annual Meeting of the Association for Symbolic Logic, University of Florida, Gainesville, Florida (March 10–13, 2007), The Bulletin of Symbolic Logic, 13(3): 407. (Scholar)
  • Pacuit, E. (2006). “A Note on Some Explicit Modal Logics”, Technical Report PP–2006–29, Institute for Logic, Language and Computation, University of Amsterdam. (Scholar)
  • Plaza, J. (2007). “Logics of public communications”, Synthese, 158(2): 165–179. (Scholar)
  • Renne, B. (2008). Dynamic Epistemic Logic with Justification, Ph. D. thesis, Computer Science Department, CUNY Graduate Center, New York, NY, USA. (Scholar)
  • –––. (2009). “Evidence Elimination in Multi-Agent Justification Logic”, in A. Heifetz (ed.), Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009), ACM Publications, pp. 227–236. (Scholar)
  • Rose, G. (1953). “Propositional calculus and realizability”, Transactions of the American Mathematical Society, 75: 1–19. (Scholar)
  • Rubtsova, N. (2006). “On Realization of \(\mathbf{S5}\)-modality by Evidence Terms”, Journal of Logic and Computation, 16(5): 671–684. (Scholar)
  • Russell, B. (1912). The Problems of Philosophy, Oxford: Oxford University Press. (Scholar)
  • Sedlár, Igor. 2013. “Justifications, Awareness and Epistemic Dynamics.” In Logical Foundations of Computer Science, edited by S. Artemov and A. Nerode, 7734: 307–18. Lecture Notes in Computer Science. Berlin/Heidelberg: Springer. (Scholar)
  • Sidon, T. (1997). “Provability logic with operations on proofs”, in S. Adian and A. Nerode (eds.), Logical Foundations of Computer Science, 4th International Symposium, LFCS’97, Yaroslavl, Russia, July 6–12, 1997, Proceedings (Lecture Notes in Computer Science: Volume 1234), Berlin: Springer, pp. 342–353. (Scholar)
  • Troelstra, A. (1998). “Realizability”, in S. Buss (ed.), Handbook of Proof Theory, Amsterdam: Elsevier, pp. 407–474. (Scholar)
  • Troelstra, A. and H. Schwichtenberg (1996). Basic Proof Theory, Amsterdam: Cambridge University Press. (Scholar)
  • Troelstra, A. and D. van Dalen (1988). Constructivism in Mathematics (Volumes 1, 2), Amsterdam: North–Holland. (Scholar)
  • van Dalen, D. (1986). “Intuitionistic logic”, in D. Gabbay and F. Guenther (eds.), Handbook of Philosophical Logic (Volume 3), Bordrecht: Reidel, pp. 225–340. (Scholar)
  • van Ditmarsch, H., W. van der Hoek, and B. Kooi (ed.), (2007). Dynamic Epistemic Logic (Synthese Library, Volume 337), Berlin: Springer.. (Scholar)
  • von Wright, G. (1951). An Essay in Modal Logic, Amsterdam: North-Holland. (Scholar)
  • Wang, R.-J. (2009). “Knowledge, Time, and Logical Omniscience”, in H. Ono, M. Kanazawa, and R. de Queiroz (eds.), Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009, Proceedings (Lecture Notes in Artificial Intelligence: Volume 5514), Berlin: Springer, pp. 394–407. (Scholar)
  • Yavorskaya (Sidon), T. (2001). “Logic of proofs and provability”, Annals of Pure and Applied Logic, 113 (1–3): 345–372. (Scholar)
  • –––. (2008). “Interacting Explicit Evidence Systems”, Theory of Computing Systems, 43(2): 272–293. (Scholar)
  • Yavorsky, R. (2001). “Provability logics with quantifiers on proofs”, Annals of Pure and Applied Logic, 113 (1–3): 373–387. (Scholar)

Generated Wed Apr 26 07:13:03 2017