Justification Logic Bibliography

[Ach10TR] Antonis Achilleos. A complexity question in Justification Logic. Technical Report TR–2010014, CUNY Ph.D. Program in Computer Science, December 2010. Later version published as [Ach11WoLLIC].
bib | .pdf | http | Abstract ]
[Ach11WoLLIC] Antonis Achilleos. A complexity question in Justification Logic. In Lev D. Beklemishev and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18–20, 2011, Proceedings, volume 6642 of Lecture Notes in Artificial Intelligence, pages 8–19. Springer, 2011.
bib | DOI | Meeting | Abstract ]
[Ach14TR] Antonis Achilleos. Complexity jumps in multiagent justification logic under interacting justifications. E-print 1402.3066, arXiv.org, February 2014.
bib | arXiv | .pdf | Abstract ]
[AltArt01PTCS] Jesse Alt and Sergei [N.] Artemov. Reflective λ-calculus. In Reinhard Kahle, Peter Schroeder-Heister, and Robert Stärk, editors, Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7–12, 2001, Proceedings, volume 2183 of Lecture Notes in Computer Science, pages 22–37. Springer, 2001.
bib | DOI | Meeting | .ps | Abstract ]
[Ant05PLS] Evangelia Antonakos. Comparing justified and common knowledge. In Proceedings of the 5th Panhellenic Logic Symposium, pages 19–25, Athens, Greece, July 25–28, 2005. University of Athens.
bib | .pdf | Meeting | Abstract ]
[Ant06TR] Evangelia Antonakos. Justified knowledge is sufficient. Technical Report TR–2006004, CUNY Ph.D. Program in Computer Science, April 2006.
bib | .pdf | http | .ps | Abstract ]
[Ant06LC] Evangelia Antonakos. Comparing justified and common knowledge. In 2005 Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '05, Athens, Greece, July 28–August 3, 2005, volume 12(2) of Bulletin of Symbolic Logic, pages 323–324. Association for Symbolic Logic, June 2006. Abstract.
bib | DOI | Meeting | .ps | Abstract ]
[Ant07ASL] Evangelia Antonakos. Epistemic logic with common and justified common knowledge. In 2007 Annual Meeting of the Association for Symbolic Logic, University of Florida, Gainesville, Florida, March 10–13, 2007, volume 13(3) of Bulletin of Symbolic Logic, pages 402–403. Association for Symbolic Logic, September 2007. Abstract.
bib | DOI | Meeting | .ps | Abstract ]
[Ant07LFCS] Evangelia Antonakos. Justified and common knowledge: Limited conservativity. In Sergei N. Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings, volume 4514 of Lecture Notes in Computer Science, pages 1–11. Springer, 2007.
bib | DOI | Meeting | Abstract ]
[Ant12TR] Evangelia Antonakos. Explicit generic common knowledge. Technical Report TR–2012010, CUNY Ph.D. Program in Computer Science, December 2012. Later version published as [Ant13LFCS].
bib | .pdf | http | Abstract ]
[Ant13LFCS] Evangelia Antonakos. Explicit generic common knowledge. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 16–28. Springer, 2013.
bib | DOI | Meeting | Abstract ]
[ArlKis09FEW] Horacio Arló-Costa and Kohei Kishida. Three proofs and the Knower in the Quantified Logic of Proofs. In Online Proceedings of Sixth Annual Formal Epistemology Workshop (FEW 2009), Carnegie Mellon University, Pittsburg, PA, USA, June 18–21, 2009. Comments to [DeaKur09FEW].
bib | .pdf | Meeting | Abstract ]
[Art94APAL] Sergei [N.] Artëmov. Logic of proofs. Annals of Pure and Applied Logic, 67(1–3):29–59, May 1994.
bib | DOI | MathSciNet review | .ps | Abstract ]
[Art95TR] Sergei N. Artemov. Operational modal logic. Technical Report MSI 95–29, Cornell University, December 1995.
bib | .ps | Abstract ]
[Art96TR] Sergei N. Artemov. Proof realization of intuitionistic and modal logics. Technical Report MSI 96–06, Cornell University, 1996.
bib | .ps | Abstract ]
[Art97TRa] Sergei N. Artemov. Proof realizations of typed λ-calculi. Technical Report MSI 97–02, Cornell University, May 1997.
bib | .ps | Abstract ]
[Art97TRb] Sergei N. Artemov. On proof realization of intuitionistic logic. Technical Report CFIS 97–08, Cornell University, October 1997. Later version published as [Art99JANCL].
bib | Abstract ]
[Art98TRa] Sergei N. Artemov. Logic of Proofs: a unified semantics for modality and λ-terms. Technical Report CFIS 98–06, Cornell University, March 1998.
bib | .ps | Abstract ]
[Art98TRb] Sergei N. Artemov. Explicit provability: the intended semantics for intuitionistic and modal logic. Technical Report CFIS 98–10, Cornell University, September 1998.
bib | .ps | Abstract ]
[Art98TRc] Sergei N. Artemov. On explicit reflection in theorem proving and formal verification. Technical Report CFIS 98–16, Cornell University, December 1998. Later version published as [Art99CADE].
bib | Abstract ]
[Art98TRd] Sergei N. Artemov. Explicit modal logic. Technical Report CFIS 98–17, Cornell University, December 1998. Extended version [Art99TRa] later published as [Art00AiML].
bib | .ps | Abstract ]
[Art99TRa] Sergei N. Artemov. Operations on proofs that can be specified by means of modal logic. Technical Report CFIS 99–02, Cornell University, February 1999. Later version published as [Art00AiML].
bib | Abstract ]
[Art99TRb] Sergei N. Artemov. Deep isomorphism of modal derivations and λ-terms. Technical Report CFIS 99–07, Cornell University, June 1999.
bib | .ps | Abstract ]
[Art99FLoC] Sergei N. Artemov. Uniform provability realization of intuitionistic logic, modality and λ-terms. In Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, and Dana S. Scott, editors, Tutorial Workshop on Realizability Semantics and Applications (associated to FLoC'99, the 1999 Federated Logic Conference), Trento, Italy, 30 June–1 July 1999, volume 23(1) of Electronic Notes in Theoretical Computer Science, pages 3–12. Elsevier, 1999.
bib | DOI | .ps | Abstract ]
[Art99CADE] Sergei N. Artemov. On explicit reflection in theorem proving and formal verification. In Harald Ganzinger, editor, Automated Deduction — CADE–16, 16th International Conference on Automated Deduction, Trento, Italy, July 7–10, 1999, Proceedings, volume 1632 of Lecture Notes in Artificial Intelligence, pages 267–281. Springer, 1999.
bib | DOI | .ps | Abstract ]
[Art99JANCL] S[ergei] N. Artemov. Realization of intuitionistic logic by proof polynomials. Journal of Applied Non-Classical Logics, 9(2–3):285–302, 1999.
bib | MathSciNet review | British Library | JANCL | Abstract ]
[Art00AiML] Sergei N. Artemov. Operations on proofs that can be specified by means of modal logic. In Michael Zakharyaschev, Krister Segerberg, Maarten de Rijke, and Heinrich Wansing, editors, Advances in Modal Logic, volume 2, volume 118 of CSLI Lecture Notes, pages 77–90. CSLI Publications, Stanford, 2000.
bib | ZMATH review | Distributor | Publisher | Meeting | .ps | Abstract ]
[Art01BSL] Sergei N. Artemov. Explicit provability and constructive semantics. Bulletin of Symbolic Logic, 7(1):1–36, March 2001.
bib | ZMATH review | MathSciNet review | JSTOR | ProjectEuclid | .ps | Abstract ]
[Art02LC] Sergei [N.] Artemov. Incompleteness theorem and two models for provability. In 2001 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '01, Vienna, Austria, Agust 6–11, 2001, volume 8(1) of Bulletin of Symbolic Logic, page 120. Association for Symbolic Logic, March 2002. Abstract of invited talk.
bib | DOI | JSTOR | .ps | Abstract ]
[Art02CSLI] Sergei N. Artemov. Unified semantics for modality and λ-terms via proof polynomials. In Kees Vermeulen and Ann Copestake, editors, Algebras, Diagrams and Decisions in Language, Logic and Computation, volume 144 of CSLI Lecture Notes, pages 89–118. CSLI Publications, Stanford, 2002.
bib | Distributor | Publisher | .ps | Abstract ]
[Art03DLC] Sergei [N.] Artemov. From proof polynomials to reflexive combinators. In Second St. Petersburg Conference on Days of Logic and Computability, St. Petersburg, Russia, August 24–26, 2003. Abstract.
bib | Meeting | Abstract ]
[Art03CSL] Sergei [N.] Artemov. Back to the future: Explicit logic for computer science. In Matthias Baaz and Johann A. Makowsky, editors, Computer Science Logic, 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25–30, 2003, Proceedings, volume 2803 of Lecture Notes in Computer Science, page 43. Springer, 2003. Abstract of invited lecture.
bib | DOI | Slides | .pdf | Meeting | Abstract ]
[Art03PSIM] S[ergei] N. Artemov. Embedding of the modal λ-calculus into the Logic of Proofs. Proceedings of the Steklov Institute of Mathematics, 242(3):36–49, 2003. Originally published in Russian.
bib | MathNet.ru | In Russian | Abstract ]
[Art04TR] Sergei [N.] Artemov. Evidence-based common knowledge. Technical Report TR–2004018, CUNY Ph.D. Program in Computer Science, November 2004. Revised in April 2005; later published as [Art06TCS].
bib | .pdf | http | .ps | Abstract ]
[Art04RMS] S[ergei] N. Artemov. Kolmogorov and Gödel's approach to intuitionistic logic: current developments. Russian Mathematical Surveys, 59(2):203–229, 2004. Originally published in Russian.
bib | DOI | ZMATH review | MathNet.ru | .ps | Abstract ]
[Art05Gabbay] Sergei [N.] Artemov. Existential semantics for modal logic. In Sergei [N.] Artemov, Howard Barringer, Artur S. d'Avila Garcez, Luís C. Lamb, and John Woods, editors, We Will Show Them! Essays in Honour of Dov Gabbay, volume 1, pages 19–30. College Publications, 2005.
bib | Publisher ]
[Art06TCS] Sergei [N.] Artemov. Justified common knowledge. Theoretical Computer Science, 357(1–3):4–22, July 2006.
bib | DOI | MathSciNet review | Abstract ]
[Art07IMS] Sergei [N.] Artemov. On two models of provability. In Dov M. Gabbay, Sergei S. Goncharov, and Michael Zakharyaschev, editors, Mathematical Problems from Applied Logic II, Logics for the XXIst Century, volume 5 of International Mathematical Series, pages 1–52. Springer, 2007.
bib | DOI | ZMATH review ]
[Art07TRa] Sergei [N.] Artemov. Symmetric Logic of Proofs. Technical Report TR–2007016, CUNY Ph.D. Program in Computer Science, September 2007. Later version published as [Art08LNCS].
bib | .pdf | http | Abstract ]
[Art07TRb] Sergei [N.] Artemov. Justification logic. Technical Report TR–2007019, CUNY Ph.D. Program in Computer Science, October 2007. Extended version [Art08TRa] later published as [Art08RSL].
bib | .pdf | http | Abstract ]
[Art07MLH] Sergei [N.] Artemov. Modal logic in mathematics. In Patrick Blackburn, Johan van Benthem, and Frank Wolter, editors, Handbook of Modal Logic, volume 3 of Studies in Logic and Practical Reasoning, chapter 16, pages 927–969. Elsevier, 2007.
bib | DOI ]
[Art08LNCS] Sergei [N.] Artemov. Symmetric Logic of Proofs. In Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, editors, Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, volume 4800 of Lecture Notes in Computer Science, pages 58–71. Springer, 2008.
bib | DOI | Abstract ]
[Art08TRa] Sergei [N.] Artemov. The logic of justification. Technical Report TR–2008010, CUNY Ph.D. Program in Computer Science, September 2008. Later version published as [Art08RSL].
bib | .pdf | http | Abstract ]
[Art08TRb] Sergei [N.] Artemov. Why do we need Justification Logic? Technical Report TR–2008014, CUNY Ph.D. Program in Computer Science, September 2008. Later version published as [Art11SynLib].
bib | .pdf | http | Abstract ]
[Art08JELIA] Sergei [N.] Artemov. Justification Logic. In Steffen Hölldobler, Carsten Lutz, and Heinrich Wansing, editors, Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008, Proceedings, volume 5293 of Lecture Notes in Artificial Intelligence, pages 1–4. Springer, 2008.
bib | DOI | Meeting ]
[Art08RSL] Sergei [N.] Artemov. The logic of justification. The Review of Symbolic Logic, 1(4):477–513, December 2008.
bib | DOI | Abstract ]
[Art10TR] Sergei [N.] Artemov. Tracking evidence. Technical Report TR–2010004, CUNY Ph.D. Program in Computer Science, April 2010. Later version published as [Art10LNCS].
bib | .pdf | http | Abstract ]
[Art10LNCS] Sergei [N.] Artemov. Tracking evidence. In Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, editors, Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, volume 6300 of Lecture Notes in Computer Science, pages 61–74. Springer, 2010.
bib | DOI | Abstract ]
[Art10LogKCA] Sergei [N.] Artemov. Justification of knowledge: Philosophy and logic. In Xabier Arrazola and María Ponte, editors, LogKCA-10, Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pages 17–36. University of the Basque Country Press, 2010.
bib | Meeting | Abstract ]
[Art11TR] Sergei N. Artemov. The ontology of justifications in the logical setting. Technical Report TR–2011008, CUNY Ph.D. Program in Computer Science, August 2011. Later version published as [Art12SL].
bib | .pdf | http | Abstract ]
[Art11SynLib] Sergei [N.] Artemov. Why do we need Justification Logic? In Johan van Benthem, Amitabha Gupta, and Eric Pacuit, editors, Games, Norms and Reasons: Logic at the Crossroads, volume 353 of Synthese Library, chapter 2, pages 23–38. Springer, 2011.
bib | DOI ]
[Art11OWR] Sergei N. Artemov. Provability vs. computational semantics for intuitionistic logic. In Oberwolfach Report 52/2011. Mathematical Logic: Proof Theory, Constructive Mathematics, volume 8(4) of Oberwolfach Reports, pages 2967–2968. EMS Publishing House, 2011. Abstract.
bib | DOI ]
[Art12SL] Sergei N. Artemov. The ontology of justifications in the logical setting. Studia Logica, 100(1–2):17–30, April 2012. Published online February 2012.
bib | DOI | Abstract ]
[ArtBek04PR] Sergei N. Artemov and Lev D. Beklemishev. Provability logic. Preprint 234, Logic Group Preprint Series, Department of Philosophy, Utrecht University, November 2004. Later version published as [ArtBek05HPL].
bib | .pdf ]
[ArtBek05HPL] Sergei N. Artemov and Lev D. Beklemishev. Provability logic. In D[ov] M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, 2nd Edition, volume 13, pages 189–360. Springer, 2005.
bib | DOI | .pdf ]
[ArtBon06Unp] Sergei [N.] Artemov and Eduardo Bonelli. The intensional lambda calculus. Extended version of [ArtBon07LFCS], December 2006.
bib | .pdf | Abstract ]
[ArtBon07LFCS] Sergei [N.] Artemov and Eduardo Bonelli. The intensional lambda calculus. In Sergei N. Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings, volume 4514 of Lecture Notes in Computer Science, pages 12–25. Springer, 2007.
bib | DOI | .pdf | Meeting | Abstract ]
[ArtChu94TR] Sergei [N.] Artëmov and Artëm Chuprina. Logic of proofs with complexity operators. Technical Report ML–1994–07, Institute for Logic, Language and Computation, University of Amsterdam, 1994. Later version published as [ArtChu96LNPAM].
bib | .ps.gz ]
[ArtChu96LNPAM] Sergei [N.] Artëmov and Artëm Chuprina. Logic of proofs with complexity operators. In Aldo Ursini and Paolo Aglianò, editors, Logic and Algebra, volume 180 of Lecture Notes in Pure and Applied Mathematics, pages 1–24. Marcel Dekker, New York, 1996.
bib | MathSciNet review | Distributor | Abstract ]
[ArtFit11SEP] Sergei [N.] Artemov and Melvin Fitting. Justification logic. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Fall 2012 edition, 2012.
bib | http ]
[ArtIem04TR] Sergei [N.] Artemov and Rosalie Iemhoff. From de Jongh's theorem to intuitionistic logic of proofs. In Vriendenboek ofwel Liber Amicorum ter gelegenheid van het afscheid van Dick de Jongh. Institute for Logic, Language and Computation, University of Amsterdam, November 22, 2004.
bib | .pdf | http | Abstract ]
[ArtIem05TR] Sergei [N.] Artemov and Rosalie Iemhoff. The basic intuitionistic logic of proofs. Technical Report TR–2005002, CUNY Ph.D. Program in Computer Science, February 2005. Later version published as [ArtIem07JSL].
bib | .pdf | http | .ps | Abstract ]
[ArtIem07JSL] Sergei [N.] Artemov and Rosalie Iemhoff. The basic intuitionistic logic of proofs. Journal of Symbolic Logic, 72(2):439–451, June 2007.
bib | DOI | ZMATH review | MathSciNet review | .pdf | ProjectEuclid | Abstract ]
[ArtKazSha99] S[ergei N.] Artemov, E. [L.] Kazakov, and D. Shapiro. Logic of knowledge with justifications. Technical Report CFIS 99–12, Cornell University, 1999.
bib | .ps ]
[ArtNKru06LC] Sergei [N.] Artemov and Nikolai [V.] Krupski. On reflexive combinatory logic. In 2005 Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '05, Athens, Greece, July 28–August 3, 2005, volume 12(2) of Bulletin of Symbolic Logic, pages 351–352. Association for Symbolic Logic, June 2006. Abstract presented by title.
bib | DOI | .ps | Abstract ]
[ArtVKru94TR] Sergei [N.] Artëmov and Vladimir [N.] Krupski. Referential data structures. Technical Report iam–94–020, Institute of Computer Science and Applied Mathematics, University of Bern, 1994. Later version published as [ArtVKru94LFCS].
bib | .ps.gz | http | Abstract ]
[ArtVKru94LFCS] Sergei [N.] Artëmov and Vladimir [N.] Krupski. Referential data structures and labeled modal logic. In A[nil] Nerode and Yu. V. Matiyasevich, editors, Logical Foundations of Computer Science, Third International Symposium, LFCS'94, St. Petersburg, Russia, July 11–14, 1994, Proceedings, volume 813 of Lecture Notes in Computer Science, pages 23–33. Springer, 1994.
bib | DOI | Abstract ]
[ArtVKru95TR] Sergei [N.] Artëmov and Vladimir [N.] Krupski. Data storage interpretation of labeled modal logic. Technical Report iam–95–002, Institute of Computer Science and Applied Mathematics, University of Bern, 1995. Later version published as [ArtVKru96APAL].
bib | .ps.gz | http | Abstract ]
[ArtVKru96APAL] Sergei [N.] Artëmov and Vladimir [N.] Krupski. Data storage interpretation of labeled modal logic. Annals of Pure and Applied Logic, 78(1–3):57–71, April 1996.
bib | DOI | .ps | Abstract ]
[ArtKuz06TR] Sergei [N.] Artemov and Roman Kuznets. Logical omniscience via proof complexity. Technical Report TR–2006005, CUNY Ph.D. Program in Computer Science, May 2006. Later version published as [ArtKuz06CSL].
bib | .pdf | http | .ps | Abstract ]
[ArtKuz06CSL] Sergei [N.] Artemov and Roman Kuznets. Logical omniscience via proof complexity. In Zoltán Ésik, editor, Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25–29, 2006, Proceedings, volume 4207 of Lecture Notes in Computer Science, pages 135–149. Springer, 2006.
bib | DOI | .pdf | Meeting | Abstract ]
[ArtKuz09TARK] Sergei [N.] Artemov and Roman Kuznets. Logical omniscience as a computational complexity problem. In Aviad Heifetz, editor, Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009), pages 14–23, Stanford University, California, July 6–8, 2009. ACM.
bib | DOI | Meeting | Abstract ]
[ArtKuz14APAL] Sergei [N.] Artemov and Roman Kuznets. Logical omniscience as infeasibility. Annals of Pure and Applied Logic, 165(1):6–25, January 2014. Published online August 2013.
bib | DOI | .pdf | Abstract ]
[ArtNog04TR] Sergei [N.] Artemov and Elena Nogina. Logic of knowledge with justifications from the provability perspective. Technical Report TR–2004011, CUNY Ph.D. Program in Computer Science, August 2004. Later versions published as technical report [ArtNog05TR], extended conference abstract [ArtNog05TARK], and journal version [ArtNog05JLC].
bib | .pdf | http | .ps | Abstract ]
[ArtNog05TR] Sergei [N.] Artemov and Elena Nogina. Basic systems of epistemic logic with justification. Technical Report TR–2005004, CUNY Ph.D. Program in Computer Science, February 2005. Later versions published as extended conference abstract [ArtNog05TARK] and journal version [ArtNog05JLC].
bib | .pdf | http | .ps | Abstract ]
[ArtNog05TARK] Sergei [N.] Artemov and Elena Nogina. On epistemic logic with justification. In Ron van der Meyden, editor, Theoretical Aspects of Rationality and Knowledge, Proceedings of the Tenth Conference (TARK 2005), pages 279–294, Singapore, June 10–12, 2005. National University of Singapore. Journal version published as [ArtNog05JLC].
bib | .pdf | Meeting | Abstract ]
[ArtNog05JLC] Sergei [N.] Artemov and Elena Nogina. Introducing justification into epistemic logic. Journal of Logic and Computation, 15(6):1059–1073, December 2005.
bib | DOI | ZMATH review | MathSciNet review | Abstract ]
[ArtNog08CSR] Sergei [N.] Artemov and Elena Nogina. Topological semantics of justification logic. In Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, and Anatol Slissenko, editors, Computer Science — Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7–12, 2008, Proceedings, volume 5010 of Lecture Notes in Computer Science, pages 30–39. Springer, 2008. Journal version published as [ArtNog08LLP].
bib | DOI | Meeting | Abstract ]
[ArtNog08LLP] Sergei [N.] Artemov and Elena Nogina. The topology of justification. Logic and Logical Philosophy, 17(1–2):59–71, March/June 2008.
bib | LLP | .pdf | Abstract ]
[ArtStr92TR] Sergei [N.] Artëmov and Tyko Straßen. The basic logic of proofs. Technical Report iam–92–018, Institute of Computer Science and Applied Mathematics, University of Bern, 1992. Later version published as [ArtStr93CSL].
bib | .ps.gz | http | Abstract ]
[ArtStr93TR] Sergei [N.] Artëmov and Tyko Straßen. Functionality in the basic logic of proofs. Technical Report iam–93–004, Institute of Computer Science and Applied Mathematics, University of Bern, 1993.
bib | .ps.gz | http | Abstract ]
[ArtStr93CSL] Sergei [N.] Artëmov and Tyko Straßen. 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 28–October 2, 1992, Selected Papers, volume 702 of Lecture Notes in Computer Science, pages 14–28. Springer, 1993.
bib | DOI | ZMATH review | Abstract ]
[ArtStr93KGC] Sergei [N.] Artëmov and Tyko Straßen. The logic of the Gödel proof predicate. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24–27, 1993, Proceedings, volume 713 of Lecture Notes in Computer Science, pages 71–82. Springer, 1993.
bib | DOI | Abstract ]
[ArtTYav01MMJ] Sergei [N.] Artemov and Tatiana Yavorskaya (Sidon). On first order logic of proofs. Moscow Mathematical Journal, 1(4):475–490, October-December 2001.
bib | ZMATH review | MathSciNet review | .pdf | AMS | Abstract ]
[ArtTYav11TR] Sergei N. Artemov and Tatiana Yavorskaya (Sidon). First-order logic of proofs. Technical Report TR–2011005, CUNY Ph.D. Program in Computer Science, May 2011.
bib | .pdf | http | Abstract ]
[ArtTYav12TR] Sergei N. Artemov and Tatiana Yavorskaya (Sidon). Binding modalities. Technical Report TR–2012011, CUNY Ph.D. Program in Computer Science, December 2012. Later version published as [ArtTYav13JLC].
bib | .pdf | http | Abstract ]
[ArtTYav13JLC] Sergei N. Artemov and Tatiana Yavorskaya (Sidon). Binding modalities. Journal of Logic and Computation, Advance Access, October 2013. Published online October 2013.
bib | DOI | Abstract ]
[BalRenSme12WoLLIC] Alexandru Baltag, Bryan Renne, and Sonja Smets. The logic of justified belief change, soft evidence and defeasible knowledge. In Luke Ong and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3–6, 2012, Proceedings, volume 7456 of Lecture Notes in Computer Science, pages 168–190. Springer, 2012.
bib | DOI | .pdf | Meeting | Abstract ]
[BalRenSme14APAL] Alexandru Baltag, Bryan Renne, and Sonja Smets. The logic of justified belief, explicit knowledge, and conclusive evidence. Annals of Pure and Applied Logic, 165(1):49–81, January 2014. Published online in August 2013.
bib | DOI | .pdf | Abstract ]
[Bav12PhD] Francisco Pedro Bavera. Types for Security based-on Information Flow and Audited Computation. PhD thesis, Universidad de Buenos Aires, 2012.
bib | .pdf | Abstract ]
[BavBon10ICTAC] Francisco [Pedro] Bavera and Eduardo Bonelli. Justification logic and history based computation. In Ana Cavalcanti, David Deharbe, Marie-Claude Gaudel, and Jim Woodcock, editors, Theoretical Aspects of Computing – ICTAC 2010, 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010, Proceedings, volume 6255 of Lecture Notes in Computer Science, pages 337–351. Springer, 2010.
bib | DOI | .pdf | Meeting | Abstract ]
[BekVis05PR] Lev D. Beklemishev and Albert Visser. Problems in the logic of provability. Preprint 235, Logic Group Preprint Series, Department of Philosophy, Utrecht University, May 2005. Later version published as [BekVis06IMS].
bib | .pdf | Abstract ]
[BekVis06IMS] Lev [D.] Beklemishev and Albert Visser. Problems in the logic of provability. In Dov M. Gabbay, Sergei S. Goncharov, and Michael Zakharyaschev, editors, Mathematical Problems from Applied Logic I, Logics for the XXIst Century, volume 4 of International Mathematical Series, pages 77–136. Springer, 2006.
bib | DOI ]
[vanBen06PS] Johan van Benthem. Epistemic logic and epistemology: The state of their affairs. In Vincent F. Hendricks, editor, 8 Bridges between Formal and Mainstream Epistemology, volume 128(1) of Philosophical Studies, pages 49–76. Springer, March 2006.
bib | DOI | .pdf ]
[vanBenMar08HPI] Johan van Benthem and Maricarmen Martinez. The stories of logic and information. In Pieter Adriaans and Johan van Benthem, editors, Philosophy of Information, volume 8 of Handbook of the Philosophy of Science, pages 217–280. Elsevier, 2008.
bib | DOI | .pdf ]
[BonFel09LFCS] Eduardo Bonelli and Federico Feller. The Logic of Proofs as a foundation for certifying mobile computation. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3–6, 2009, Proceedings, volume 5407 of Lecture Notes in Computer Science, pages 76–91. Springer, 2009. Errata available at http://www.lifia.info.unlp.edu.ar/~eduardo/publications/errataLFCS09.txt.
bib | DOI | Meeting | Abstract ]
[BonFel09Unp] Eduardo Bonelli and Federico Feller. The Logic of Proofs as a foundation for certifying mobile computation. Extended version of [BonFel09LFCS], 2009.
bib | .pdf | Abstract ]
[Bre99MT] Vladimir N. Brezhnev. Explicit counterparts of modal logic. Master's thesis, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, 1999. In Russian.
bib ]
[Bre00TR] Vladimir N. Brezhnev. On explicit counterparts of modal logics. Technical Report CFIS 2000–05, Cornell University, 2000.
bib | Abstract ]
[Bre01ESSLLI] Vladimir [N.] Brezhnev. On the logic of proofs. In Kristina Striegnitz, editor, Proceedings of the sixth ESSLLI Student Session, 13th European Summer School in Logic, Language and Information (ESSLLI'01), pages 35–46, Helsinki, August 2001. FoLLI.
bib | Meeting | .ps.gz | Abstract ]
[BreKuz05TR] Vladimir [N.] Brezhnev and Roman Kuznets. Making knowledge explicit: How hard it is. Technical Report TR–2005003, CUNY Ph.D. Program in Computer Science, February 2005. Later version published as [BreKuz06TCS].
bib | .pdf | http | Abstract ]
[BreKuz06TCS] Vladimir [N.] Brezhnev and Roman Kuznets. Making knowledge explicit: How hard it is. Theoretical Computer Science, 357(1–3):23–34, July 2006.
bib | DOI | MathSciNet review | .pdf | Abstract ]
[BrueGoeKuz10AiML] Kai Brünnler, Remo Goetschi, and Roman Kuznets. A syntactic realization theorem for justification logics. In Lev [D.] Beklemishev, Valentin Goranko, and Valentin Shehtman, editors, Advances in Modal Logic, Volume 8, pages 39–58. College Publications, 2010.
bib | Slides | .pdf | Publisher | Meeting | Abstract ]
[Bry05M4M] Yegor Bryukhov. Automatic proof search in logic of justified common knowledge. In H. Schlingloff, editor, Proceedings of the 4th Workshop “Methods for Modalities” (M4M'05), Berlin, Germany, December 1–2, 2005, number 194 in Informatik-Berichte, pages 187–201. Humboldt-Universität zu Berlin, Institut für Informatik, December 2005.
bib | .pdf | Proceedings | Meeting | http | Abstract ]
[Bry06PhD] Yegor Bryukhov. Integration of Decision Procedures into High-Order Interactive Provers. PhD thesis, City University of New York, 2006.
bib | .pdf | .html | Abstract ]
[Buc12PhD] Samuel Bucheli. Justification Logics with Common Knowledge. PhD thesis, Universität Bern, May 2012.
bib | .pdf ]
[BucKuzRenSacStu10LogKCA] Samuel Bucheli, Roman Kuznets, Bryan Renne, Joshua Sack, and Thomas Studer. Justified belief change. In Xabier Arrazola and María Ponte, editors, LogKCA-10, Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pages 135–155. University of the Basque Country Press, 2010.
bib | .pdf | Meeting | Abstract ]
[BucKuzStu10M4M] Samuel Bucheli, Roman Kuznets, and Thomas Studer. Two ways to common knowledge. In Thomas Bolander and Torben Braüner, editors, Proceedings of the 6th Workshop on Methods for Modalities (M4M–6 2009), Copenhagen, Denmark, 12–14 November 2009, number 262 in Electronic Notes in Theoretical Computer Science, pages 83–98. Elsevier, May 2010.
bib | DOI | .pdf | Meeting | Abstract ]
[BucKuzStu10TR] Samuel Bucheli, Roman Kuznets, and Thomas Studer. Explicit evidence systems with common knowledge. E-print 1005.0484, arXiv.org, May 2010. Later version published as [BucKuzStu11JANCL].
bib | arXiv | .pdf | Abstract ]
[BucKuzStu11JANCL] Samuel Bucheli, Roman Kuznets, and Thomas Studer. Justifications for common knowledge. Journal of Applied Non-Classical Logics, 21(1):35–60, January–March 2011.
bib | DOI | .pdf | Abstract ]
[BucKuzStu11WoLLIC] Samuel Bucheli, Roman Kuznets, and Thomas Studer. Partial realization in dynamic justification logic. In Lev D. Beklemishev and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18–20, 2011, Proceedings, volume 6642 of Lecture Notes in Artificial Intelligence, pages 35–51. Springer, 2011.
bib | DOI | .pdf | Meeting | Abstract ]
[BucKuzStu13LNCS] Samuel Bucheli, Roman Kuznets, and Thomas Studer. Decidability for justification logics revisited. In Guram Bezhanishvili, Sebastian Löbner, Vincenzo Marra, and Frank Richter, editors, Logic, Language, and Computation, 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011, Revised Selected Papers, volume 7758 of Lecture Notes in Computer Science, pages 166–181. Springer, 2013.
bib | DOI | .pdf | Meeting | Abstract ]
[BusKuz09LFCS] Samuel R. Buss and Roman Kuznets. The NP-completeness of reflected fragments of justification logics. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3–6, 2009, Proceedings, volume 5407 of Lecture Notes in Computer Science, pages 122–136. Springer, 2009. Later version published as [BusKuz12APAL].
bib | DOI | Slides | .pdf | Meeting | Abstract ]
[BusKuz12APAL] Samuel R. Buss and Roman Kuznets. Lower complexity bounds in justification logic. Annals of Pure and Applied Logic, 163(7):888–905, July 2012. Published online November 2011.
bib | DOI | .pdf | Abstract ]
[Das08PR] Evgenij Dashkov. Intuitionistic logic of proofs. Preprint 269, Logic Group Preprint Series, Department of Philosophy, Utrecht University, November 2008.
bib | .pdf ]
[Das11JLC] Evgenij Dashkov. Arithmetical completeness of the intuitionistic logic of proofs. Journal of Logic and Computation, 21(4):665–682, August 2011. Published online August 2009.
bib | DOI | Abstract ]
[Das12PhD] Evgenij Dashkov. On Propositional Calculi That Represent the Notion of Provability. PhD thesis, Lomonosov Moscow State University, September 2012. In Russian.
bib ]
[DeaKur10Synthese] W[alter] Dean and H[idenori] Kurokawa. From the Knowability Paradox to the existence of proofs. Synthese, 176(2):177–225, September 2010. Published online May 2009.
bib | DOI | Abstract ]
[DeaKur09FEW] Walter Dean and Hidenori Kurokawa. Knowledge, proof and the Knower. In Online Proceedings of Sixth Annual Formal Epistemology Workshop (FEW 2009), Carnegie Mellon University, Pittsburg, PA, USA, June 18–21, 2009. Later version published as [DeaKur09TARK]; comments by H. Arló-Costa and K. Kishida available as [ArlKis09FEW].
bib | Slides | .pdf | Meeting | Abstract ]
[DeaKur09TARK] Walter Dean and Hidenori Kurokawa. Knowledge, proof and the Knower. In Aviad Heifetz, editor, Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009), pages 81–90, Stanford University, California, July 6–8, 2009. ACM.
bib | DOI | Meeting | Abstract ]
[DeaKur14APAL] Walter Dean and Hidenori Kurokawa. The Paradox of the Knower revisited. Annals of Pure and Applied Logic, 165(1):199–224, January 2014. Published online in August 2013.
bib | DOI | Abstract ]
[Fin10JLC] Marcelo Finger. Analytic methods for the logic of proofs. Journal of Logic and Computation, 20(1):167–188, February 2010. Published online November 2008.
bib | DOI | .pdf | Abstract ]
[Fit03TRa] Melvin 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, September 2003.
bib | .pdf | http ]
[Fit03TRb] Melvin Fitting. A semantics for the Logic of Proofs. Technical Report TR–2003012, CUNY Ph.D. Program in Computer Science, September 2003.
bib | .pdf | http ]
[Fit04TRa] Melvin Fitting. Semantics and tableaus for LPS4. Technical Report TR–2004016, CUNY Ph.D. Program in Computer Science, October 2004.
bib | .pdf | http | .ps | Abstract ]
[Fit04TRb] Melvin Fitting. Quantified LP. Technical Report TR–2004019, CUNY Ph.D. Program in Computer Science, December 2004.
bib | .pdf | http | Abstract ]
[Fit05APAL] Melvin Fitting. The logic of proofs, semantically. Annals of Pure and Applied Logic, 132(1):1–25, February 2005.
bib | DOI | ZMATH review | MathSciNet review | .pdf | Abstract ]
[Fit05LY] Melvin Fitting. A logic of explicit knowledge. In Libor Běhounek and Marta Bílková, editors, Logica Yearbook 2004, pages 11–22. Filosofia, Prague, 2005.
bib | .pdf | Publisher | Meeting | Abstract ]
[Fit05PLS] Melvin Fitting. A quantified logic of explicit evidence. In Proceedings of the 5th Panhellenic Logic Symposium, page 6, Athens, Greece, July 25–28, 2005. University of Athens. Abstract of invited talk.
bib | .pdf | Meeting | Abstract ]
[Fit06WoLLIC] Melvin Fitting. A quantified logic of evidence. In R[uy] de Queiroz, A. Macintyre, and G. Bittencourt, editors, Proceedings of the 12th Workshop on Logic, Language, Information and Computation (WoLLIC 2005), Florianópolis, Santa Catarina, Brazil, 19–22 July 2005, volume 143 of Electronic Notes in Theoretical Computer Science, pages 59–71. Elsevier, January 2006. Journal version published as [Fit08APAL].
bib | DOI | Slides | Meeting | Abstract ]
[Fit06TR] Melvin Fitting. A replacement theorem for LP. Technical Report TR–2006002, CUNY Ph.D. Program in Computer Science, March 2006.
bib | .pdf | http | Abstract ]
[Fit07TRa] Melvin Fitting. Realizing substitution instances of modal theorems. Technical Report TR–2007006, CUNY Ph.D. Program in Computer Science, March 2007.
bib | .pdf | http | .ps | Abstract ]
[Fit07LFCS] Melvin Fitting. Realizations and LP. In Sergei N. Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings, volume 4514 of Lecture Notes in Computer Science, pages 212–223. Springer, 2007. Journal version published as [Fit09APAL].
bib | DOI | Meeting | Abstract ]
[Fit07TRb] Melvin Fitting. Justification logics and conservative extensions. Technical Report TR–2007015, CUNY Ph.D. Program in Computer Science, July 2007. Later versions published as conference presentation [Fit08ISAIM] and journal version [Fit08AMAI].
bib | .pdf | http | Abstract ]
[Fit07TRc] Melvin Fitting. S4LP and local realizability. Technical Report TR–2007020, CUNY Ph.D. Program in Computer Science, November 2007. Later version published as [Fit08CSR].
bib | .pdf | http | Abstract ]
[Fit08ISAIM] Melvin Fitting. Explicit logics of knowledge and conservativity. In Online Proceedings of Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM 2008), Fort Lauderdale, Florida, USA, January 2–4, 2008. Journal version published as [Fit08AMAI].
bib | .pdf | Meeting | Abstract ]
[Fit08APAL] Melvin Fitting. A quantified logic of evidence. Annals of Pure and Applied Logic, 152(1–3):67–83, March 2008.
bib | DOI | MathSciNet review | .pdf | Abstract ]
[Fit08CSR] Melvin Fitting. S4LP and local realizability. In Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, and Anatol Slissenko, editors, Computer Science — Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7–12, 2008, Proceedings, volume 5010 of Lecture Notes in Computer Science, pages 168–179. Springer, 2008.
bib | DOI | .pdf | Meeting | Abstract ]
[Fit08AMAI] Melvin Fitting. Justification logics, logics of knowledge, and conservativity. Annals of Mathematics and Artificial Intelligence, 53(1–4):153–167, August 2008.
bib | DOI | .pdf | Abstract ]
[Fit09TL] Melvin Fitting. Reasoning with justifications. In David Makinson, Jacek Malinowski, and Heinrich Wansing, editors, Towards Mathematical Philosophy, Papers from the Studia Logica conference Trends in Logic IV, volume 28 of Trends in Logic, chapter 6, pages 107–123. Springer, 2009. Published online November 2008.
bib | DOI | .pdf | Meeting | Abstract ]
[Fit09APAL] Melvin Fitting. Realizations and LP. Annals of Pure and Applied Logic, 161(3):368–387, December 2009. Published online August 2009.
bib | DOI | .pdf | Abstract ]
[Fit10JAL] Melvin Fitting. Justification logics and hybrid logics. Journal of Applied Logic, 8(4):356–370, December 2010. Published online August 2010.
bib | DOI | .pdf | Abstract ]
[Fit11TR] Melvin Fitting. Possible world semantics for first order LP. Technical Report TR–2011010, CUNY Ph.D. Program in Computer Science, September 2011.
bib | .pdf | http | Abstract ]
[Fit11SynLib] Melvin Fitting. The realization theorem for S5: A simple, constructive proof. In Johan van Benthem, Amitabha Gupta, and Eric Pacuit, editors, Games, Norms and Reasons: Logic at the Crossroads, volume 353 of Synthese Library, chapter 4, pages 61–76. Springer, 2011.
bib | DOI | .pdf ]
[Fit12APAL] Melvin Fitting. Prefixed tableaus and nested sequents. Annals of Pure and Applied Logic, 163(3):291–313, March 2012. Published online October 2011.
bib | DOI | .pdf | Abstract ]
[Fit13TR] Melvin Fitting. Realization implemented. Technical Report TR–2013005, CUNY Ph.D. Program in Computer Science, May 2013.
bib | .pdf | http | Abstract ]
[Fit13JLC] Melvin Fitting. Realization using the model existence theorem. Journal of Logic and Computation, Advance Access, July 2013. Published online July 2013.
bib | DOI | .pdf | Abstract ]
[Fit14APAL] Melvin Fitting. Possible world semantics for first-order logic of proofs. Annals of Pure and Applied Logic, 165(1):225–240, January 2014. Published online in August 2013.
bib | DOI | .pdf | Abstract ]
[GabMak05book] Dov M. Gabbay and Larisa Maksimova. Interpolation and Definability: Modal and Intuitionistic Logic, volume 46 of Oxford Logic Guides, chapter 1.3, pages 25–34. Clarendon Press, Oxford, 2005.
bib | DOI ]
[Gha10ESSLLI] Meghdad Ghari. Justification counterpart of distributed knowledge systems. In Marija Slavkovik, editor, Proceedings of the 15th Student Session of 13th European Summer School for Logic, Language and Information, pages 25–36, Copenhagen, Denmark, August 9–20, 2010. FoLLI. Later version with errata published as [Gha12LNCS]; journal version published as [Gha13TOCS].
bib | .pdf | Abstract ]
[Gha11AIMC] Meghdad Ghari. Explicit Gödel-Löb provability logic. In Proceeding of The 42nd Annual Iranian Mathematics Conference, pages 911–914, Vali-e-Asr University, Rafsanjan, Iran, September 5–8, 2011.
bib | .pdf | Meeting | Abstract ]
[Gha12PJMS] Meghdad Ghari. Realization theorem for epistemic logic with justification. Proceedings of the Jangjeon Mathematical Society, 15(1):47–52, 2012.
bib | .pdf | http | Abstract ]
[Gha12LNCS] Meghdad Ghari. Distributed knowledge with justifications. In Daniel Lassiter and Marija Slavkovik, editors, New Directions in Logic, Language and Computation, ESSLLI 2010 and ESSLLI 2011 Student Sessions, Selected Papers, volume 7415 of Lecture Notes in Computer Science, pages 91–108. Springer, 2012. Journal version published as [Gha13TOCS].
bib | DOI | Abstract ]
[Gha12JLC] Meghdad Ghari. Cut elimination and realization for epistemic logics with justification. Journal of Logic and Computation, 22(5):1171–1198, October 2012. Published online July 2011.
bib | DOI | Abstract ]
[Gha13TOCS] Meghdad Ghari. Distributed knowledge justification logics. Theory of Computing Systems, Online First, August 2013. Published online August 2013.
bib | DOI | Abstract ]
[Gha14TR] Meghdad Ghari. Labeled sequent calculus and countermodel construction for justification logics. E-print 1401.1065, arXiv.org, January 2014.
bib | arXiv | .pdf | Abstract ]
[Gio13RSL] Alessandro Giordani. A logic of justification and truthmaking. The Review of Symbolic Logic, 6(2):323–342, June 2013. Published online March 2013.
bib | DOI | Abstract ]
[Gio13SL] Alessandro Giordani. A new semantics for systems of logic of essence. Studia Logica, Online First, May 2013. Published online May 2013.
bib | DOI | Abstract ]
[Goed38CW] Kurt Gödel. Vortrag bei Zilsel/Lecture at Zilsel's (*1938a). In Solomon Feferman, John W. Dawson, Jr., Warren Goldfarb, Charles Parsons, and Robert M. Solovay, editors, Unpublished essays and lectures, volume III of Kurt Gödel Collected Works, pages 86–113. Oxford University Press, 1995.
bib | Publisher ]
[Goe12PhD] Remo Goetschi. On the Realization and Classification of Justification Logics. PhD thesis, Universität Bern, September 2012.
bib | .pdf ]
[GoeKuz12APAL] Remo Goetschi and Roman Kuznets. Realization for justification logics via nested sequents: Modularity through embedding. Annals of Pure and Applied Logic, 163(9):1271–1298, September 2012. Published online March 2012.
bib | DOI | .pdf | Abstract ]
[Gor05TR] Evan Goris. Logic of Proofs for bounded arithmetic. Technical Report TR–2005011, CUNY Ph.D. Program in Computer Science, October 2005. Later versions published as conference presentation [Gor06CSR] and journal version [Gor08TOCS].
bib | .pdf | http | .ps | Abstract ]
[Gor06TR] Evan Goris. Explicit proofs in formal provability logic. Technical Report TR–2006003, CUNY Ph.D. Program in Computer Science, March 2006. Later version published as [Gor07LFCS].
bib | .pdf | http | .ps | Abstract ]
[Gor06CSR] Evan Goris. Logic of Proofs for bounded arithmetic. In Dima Grigoriev, John Harrison, and Edward A. Hirsch, editors, Computer Science — Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8–12, 2006, Proceedings, volume 3967 of Lecture Notes in Computer Science, pages 191–201. Springer, 2006. Journal version published as [Gor08TOCS].
bib | DOI | Meeting | Abstract ]
[Gor07TR] Evan Goris. Interpreting knowledge into belief in the presence of negative introspection. Technical Report TR–2007005, CUNY Ph.D. Program in Computer Science, March 2007.
bib | .pdf | http | Abstract ]
[Gor07LFCS] Evan Goris. Explicit proofs in formal provability logic. In Sergei N. Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings, volume 4514 of Lecture Notes in Computer Science, pages 241–253. Springer, 2007.
bib | DOI | Meeting | Abstract ]
[Gor08TOCS] Evan Goris. Feasible operations on proofs: The Logic of Proofs for bounded arithmetic. Theory of Computing Systems, 43(2):185–203, August 2008. Published online October 2007.
bib | DOI | ZMATH review | Abstract ]
[Gor09APAL] Evan Goris. A modal provability logic of explicit and implicit proofs. Annals of Pure and Applied Logic, 161(3):388–403, December 2009. Published online August 2009.
bib | DOI | Abstract ]
[HalPuc07TARK] Joseph Y. Halpern and Riccardo Pucella. Dealing with logical omniscience. In Dov Samet, editor, Theoretical Aspects of Rationality and Knowledge, Proceedings of the XIth conference (TARK 2007), pages 169–176, Brussels, Belgium, June 25–27, 2007. ACM.
bib | DOI | .pdf | Meeting | Abstract ]
[Iem06ASL] Rosalie Iemhoff. Basic intuitionistic logic of proofs. In 2005 Annual Meeting of the Association for Symbolic Logic, Stanford University, Stanford, CA, March 19–22, 2005, volume 12(1) of Bulletin of Symbolic Logic, page 154. Association for Symbolic Logic, March 2006. Abstract.
bib | DOI | JSTOR | Meeting | .ps | Abstract ]
[JapdeJon98HPT] Giorgi Japaridze and Dick de Jongh. The logic of provability. In Samuel R. Buss, editor, Handbook of Proof Theory, volume 137 of Studies in Logic and the Foundations of Mathematics, chapter VII, pages 475–546. Elsevier, 1998.
bib | DOI | .pdf ]
[Kaz99MT] E. L. Kazakov. Logics of proofs for S5. Master's thesis, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, 1999. In Russian.
bib ]
[Kra13ICLA] Simon Kramer. Logic of non-monotonic interactive proofs. In Kamal Lodaya, editor, Logic and Its Applications, 5th Indian Conference, ICLA 2013, Chennai, India, January 10-12, 2013, Proceedings, volume 7750 of Lecture Notes in Computer Science, pages 173–184. Springer, 2013.
bib | DOI | Meeting | Abstract ]
[NKru03TR] Nikolai V. Krupski. On the complexity of the reflected logic of proofs. Technical Report TR–2003007, CUNY Ph.D. Program in Computer Science, May 2003. Later version published as [NKru06TCS].
bib | .pdf | http | .ps | Abstract ]
[NKru05TR] Nikolai [V.] Krupski. Typing in reflective combinatory logic. Technical Report TR–2005013, CUNY Ph.D. Program in Computer Science, October 2005. Later version is published as [NKru06APAL].
bib | .pdf | http | .ps | Abstract ]
[NKru06PhD] Nikolai V. Krupski. On Certain Algorithmic Problems for Formal Systems with Internalization Property. PhD thesis, Lomonosov Moscow State University, April 2006. In Russian.
bib ]
[NKru06MUMBa] N[ikolai] V. Krupskii. Minimal models and complexity of fragments of the logic of proofs. Moscow University Mathematics Bulletin, 61(1):32–34, 2006. Originally published in Russian.
bib | MathSciNet | British Library ]
[NKru06MUMBb] N[ikolai] V. Krupski. Restoration of types in the reflexive combinatorial logic. Moscow University Mathematics Bulletin, 61(3):32–34, 2006. Originally published in Russian.
bib | British Library ]
[NKru06TCS] Nikolai V. Krupski. On the complexity of the reflected logic of proofs. Theoretical Computer Science, 357(1–3):136–142, July 2006.
bib | DOI | Abstract ]
[NKru06APAL] Nikolai [V.] Krupski. Typing in reflective combinatory logic. Annals of Pure and Applied Logic, 141(1–2):243–256, August 2006.
bib | DOI | ZMATH review | Abstract ]
[VKru97LFCS] Vladimir N. Krupski. Operational logic of proofs with functionality condition on proof predicate. In Sergei Adian and Anil Nerode, editors, Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6–12, 1997, Proceedings, volume 1234 of Lecture Notes in Computer Science, pages 167–177. Springer, 1997.
bib | DOI | .PS | Abstract ]
[VKru99SVIAM] V[ladimir N.] Krupski. On proof term representation for PA-admissible inference rules. Reports of Enlarged Session of the Seminar of I. Vekua Institute of Applied Mathematics, 14(4):47–48, 1999.
bib ]
[VKru01APAL] Vladimir N. Krupski. The single-conclusion proof logic and inference rules specification. Annals of Pure and Applied Logic, 113(1–3):181–206, December 2001.
bib | DOI | MathSciNet review | Meeting | .ps | Abstract ]
[VKru06JLC] Vladimir N. Krupski. Reference constructions in the single-conclusion proof logic. Journal of Logic and Computation, 16(5):645–661, October 2006.
bib | DOI | MathSciNet review | Meeting | Abstract ]
[VKru06TCS] Vladimir N. Krupski. Referential logic of proofs. Theoretical Computer Science, 357(1–3):143–166, July 2006.
bib | DOI | MathSciNet review | .pdf | Abstract ]
[VKru10CSR] Vladimir N. Krupski. Symbolic models for single-conclusion proof logics. In Farid Ablayev and Ernst W. Mayr, editors, Computer Science — Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16–20, 2010, Proceedings, volume 6072 of Lecture Notes in Computer Science, pages 276–287. Springer, 2010.
bib | DOI | Meeting | Abstract ]
[VKru11SM] V[ladimir] N. Krupski. On symbolic models for Single-Conclusion Logic of Proofs. Sbornik: Mathematics, 202(5):683–695, 2011. Originally published in Russian.
bib | DOI | Abstract ]
[Kur09LFCS] Hidenori Kurokawa. Tableaux and hypersequents for Justification Logic. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3–6, 2009, Proceedings, volume 5407 of Lecture Notes in Computer Science, pages 295–308. Springer, 2009. Later version published as [Kur12APAL].
bib | DOI | Meeting | Abstract ]
[Kur12APAL] Hidenori Kurokawa. Tableaux and hypersequents for justification logics. Annals of Pure and Applied Logic, 163(7):831–853, July 2012. Published online October 2011.
bib | DOI | Abstract ]
[Kur12PhD] Hidenori Kurokawa. Tableaux and Hypersequents for Modal and Justification Logics. PhD thesis, City University of New York, 2012.
bib | .html | Abstract ]
[KurKus13WoLLIC] Hidenori Kurokawa and Hirohiko Kushida. Substructural logic of proofs. In Leonid Libkin, Ulrich Kohlenbach, and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, Agust 20-23, 2013, Proceedings, volume 8071 of Lecture Notes in Computer Science, pages 194–210. Springer, 2013.
bib | DOI | Meeting | Abstract ]
[Kus07TR] Hirohiko Kushida. Linear Logic with explicit resources. Technical Report TR–2007017, CUNY Ph.D. Program in Computer Science, September 2007.
bib | .pdf | http | Abstract ]
[Kuz00CSL] Roman Kuznets. On the complexity of explicit modal logics. In Peter G. Clote and Helmut Schwichtenberg, editors, Computer Science Logic, 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Fischbachau, Germany, August 21–26, 2000, Proceedings, volume 1862 of Lecture Notes in Computer Science, pages 371–383. Springer, 2000. Errata concerning the explicit counterparts of D and D4 are published as [Kuz09LC].
bib | DOI | .pdf | Meeting | Abstract ]
[Kuz05ASL] Roman Kuznets. On decidability of the logic of proofs with arbitrary constant specifications. In 2004 Annual Meeting of the Association for Symbolic Logic, Carnegie Mellon University, Pittsburgh, PA, May 19–23, 2004, volume 11(1) of Bulletin of Symbolic Logic, page 111. Association for Symbolic Logic, March 2005. Abstract.
bib | JSTOR | ProjectEuclid | Meeting | .ps | Abstract ]
[Kuz06LC] Roman Kuznets. Logic of Proofs as a measure of Hilbert-style proof complexity. In 2005 Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '05, Athens, Greece, July 28–August 3, 2005, volume 12(2) of Bulletin of Symbolic Logic, page 355. Association for Symbolic Logic, June 2006. Abstract presented by title.
bib | DOI | .ps | Abstract ]
[Kuz06ASLAPA] Roman Kuznets. On self-referentiality in modal logic. In 2005–06 Winter Meeting of the Association for Symbolic Logic, The Hilton New York Hotel, New York, NY, December 27–29, 2005, volume 12(3) of Bulletin of Symbolic Logic, page 510. Association for Symbolic Logic, September 2006. Abstract.
bib | DOI | JSTOR | .ps | Abstract ]
[Kuz06ESSLLI] Roman Kuznets. Complexity of evidence-based knowledge. In Sergei [N.] Artemov and Rohit Parikh, editors, Proceedings of the Workshop on Rationality and Knowledge, 18th European Summer School in Logic, Language and Information (ESSLLI'06), pages 66–75, Málaga, Spain, August 7–11, 2006. FoLLI.
bib | .pdf | Meeting | Abstract ]
[Kuz07LFCS] Roman Kuznets. Proof identity for classical logic: Generalizing to normality. In Sergei N. Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007, Proceedings, volume 4514 of Lecture Notes in Computer Science, pages 332–348. Springer, 2007.
bib | DOI | .pdf | Meeting | Abstract ]
[Kuz08PhD] Roman Kuznets. Complexity Issues in Justification Logic. PhD thesis, City University of New York, May 2008.
bib | .pdf | .html | Abstract ]
[Kuz08CSR] Roman Kuznets. Self-referentiality of justified knowledge. In Edward A. Hirsch, Alexander A. Razborov, Alexei Semenov, and Anatol Slissenko, editors, Computer Science — Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7–12, 2008, Proceedings, volume 5010 of Lecture Notes in Computer Science, pages 228–239. Springer, 2008.
bib | DOI | .pdf | Meeting | Abstract ]
[Kuz09LC] Roman Kuznets. Complexity through tableaux in justification logic. In 2008 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '08, Bern, Switzerland, July 3–July 8, 2008, volume 15(1) of Bulletin of Symbolic Logic, page 121. Association for Symbolic Logic, March 2009. Abstract.
bib | DOI | .ps | Abstract ]
[Kuz10TOCS] Roman Kuznets. Self-referential justifications in epistemic logic. Theory of Computing Systems, 46(4):636–661, May 2010. Published online April 2009.
bib | DOI | .pdf | Abstract ]
[Kuz09PLS] Roman Kuznets. A note on the use of sum in the Logic of Proofs. In Costas Drossos, Pavlos Peppas, and Constantine Tsinakis, editors, Proceedings of the 7th Panhellenic Logic Symposium, pages 99–103, Patras University, Greece, July 15–19, 2009. Patras University Press.
bib | .pdf | Meeting | Abstract ]
[Kuz10PCC] Roman Kuznets. A note on the abnormality of realizations of S4LP. In Kai Brünnler and Thomas Studer, editors, Proof, Computation, Complexity PCC 2010, International Workshop, Proceedings, number IAM–10–001 in IAM Technical Reports. Institute of Computer Science and Applied Mathematics, University of Bern, June 2010. Abstract.
bib | .pdf | Proceedings | Meeting | http ]
[KuzStu12AiML] Roman Kuznets and Thomas Studer. Justifications, ontology, and conservativity. In Thomas Bolander, Torben Braüner, Silvio Ghilardi, and Lawrence Moss, editors, Advances in Modal Logic, Volume 9, pages 437–458. College Publications, 2012.
bib | .pdf | Publisher | Meeting | Abstract ]
[KuzStu13LFCS] Roman Kuznets and Thomas Studer. Update as evidence: Belief expansion. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 266–279. Springer, 2013.
bib | DOI | .pdf | Meeting | Abstract ]
[Len09TR] Florian Lengyel. Cartesian closed categories for the Logic of Proofs. Technical Report TR–2009002, CUNY Ph.D. Program in Computer Science, March 2009.
bib | .pdf | http | Abstract ]
[LenSt-Pie12TR] Florian Lengyel and Benoit St-Pierre. Denial logic. E-print 1203.0389, arXiv.org, May 2012. First version posted March 2012.
bib | arXiv | .pdf | Abstract ]
[LetGro11ArgMAS] Ioan Alfred Letia and Adrian Groza. Arguing with justifications between collaborating agents. In Peter McBurney, Simon Parsons, and Iyad Rahwan, editors, ArgMAS 2011, Eighth International Workshop on Argumentation in Multi-Agent Systems, In conjunction with AAMAS 2011, Workshop Proceedings, pages 44–57, Taipei, Taiwan, May 2011. Later version published as [LetGro12LNAI].
bib | .pdf | Meeting | Abstract ]
[LetGro12LNAI] Ioan Alfred Letia and Adrian Groza. Arguing with justifications between collaborating agents. In Peter McBurney, Simon Parsons, and Iyad Rahwan, editors, Argumentation in Multi-Agent Systems, 8th International Workshop, ArgMAS 2011, Taipei, Taiwan, May 3, 2011, Revised Selected Papers, volume 7543 of Lecture Notes in Artificial Intelligence, pages 102–116. Springer, 2012.
bib | DOI | Abstract ]
[LetGro13TR] Ioan Alfred Letia and Adrian Groza. Justificatory and explanatory argumentation for committing agents. E-print 1304.3860, arXiv.org, April 2013.
bib | arXiv | .pdf | Abstract ]
[Lew12TR] Steffen Lewitzka. Necessity as justified truth. E-print 1205.3803, arXiv.org, June 2012. First version posted May 2012.
bib | arXiv | .pdf | Abstract ]
[LucMon99SL] Duccio Luchi and Franco Montagna. An operational logic of proofs with positive and negative information. Studia Logica, 63(1):7–25, July 1999.
bib | DOI | Abstract ]
[Mil02ASL] Robert S. Milnikel. Explicit non-provability and nonmonotonic S4. In 2001–2002 Winter Meeting of the Association for Symbolic Logic, San Diego Marriott Hotel and Marina, San Diego, California, January 8–9, 2002, volume 8(2) of Bulletin of Symbolic Logic, pages 317–318. Association for Symbolic Logic, June 2002. Abstract.
bib | DOI | .ps | Abstract ]
[Mil07APAL] Robert [S.] Milnikel. Derivability in certain subsystems of the Logic of Proofs is Πp2-complete. Annals of Pure and Applied Logic, 145(3):223–239, March 2007.
bib | DOI | ZMATH review | MathSciNet review | Abstract ]
[Mil09LFCS] Robert S. Milnikel. Conservativity for logics of justified belief. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3–6, 2009, Proceedings, volume 5407 of Lecture Notes in Computer Science, pages 354–364. Springer, 2009. Later version published as [Mil12APAL].
bib | DOI | Meeting | Abstract ]
[Mil12APAL] Robert S. Milnikel. Conservativity for logics of justified belief: Two approaches. Annals of Pure and Applied Logic, 163(7), July 2012. Published online October 2011.
bib | DOI | .pdf | Abstract ]
[Mil13LFCS] Bob Milnikel. The logic of uncertain justifications. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 296–306. Springer, 2013. Later version published as [Mil14APAL].
bib | DOI | Meeting | Abstract ]
[Mil14APAL] Robert S. Milnikel. The logic of uncertain justifications. Annals of Pure and Applied Logic, 165(1):305–315, January 2014. Published online in August 2013.
bib | DOI | Abstract ]
[Mkr97LFCS] Alexey Mkrtychev. Models for the logic of proofs. In Sergei Adian and Anil Nerode, editors, Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6–12, 1997, Proceedings, volume 1234 of Lecture Notes in Computer Science, pages 266–275. Springer, 1997.
bib | DOI | Abstract ]
[Nog94TR] Elena Nogina. Logic of Proofs with the strong provability operator. Technical Report ML–1994–10, Institute for Logic, Language and Computation, University of Amsterdam, October 1994.
bib | .ps.gz | Abstract ]
[Nog96FAM] E[lena] Nogina. Grzegorczyk logic with arithmetical proof operators. Fundamental and Applied Mathematics, 2(2):483–499, 1996. In Russian.
bib | MathNet.ru | In Russian | http | Abstract ]
[Nog06LC] Elena Nogina. 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, volume 12(2) of Bulletin of Symbolic Logic, page 356. Association for Symbolic Logic, June 2006. Abstract presented by title.
bib | DOI | .ps | Abstract ]
[Nog07ASL] Elena Nogina. Epistemic completeness of GLA. In 2007 Annual Meeting of the Association for Symbolic Logic, University of Florida, Gainesville, Florida, March 10–13, 2007, volume 13(3) of Bulletin of Symbolic Logic, page 407. Association for Symbolic Logic, September 2007. Abstract.
bib | DOI | Meeting | .ps | Abstract ]
[Nog09LC] Elena Nogina. Logic of strong provability and explicit proofs. In 2008 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '08, Bern, Switzerland, July 3–July 8, 2008, volume 15(1) of Bulletin of Symbolic Logic, pages 124–125. Association for Symbolic Logic, March 2009. Abstract.
bib | DOI | .ps | Abstract ]
[Nov09PhD] Natalia Novak. Computer-aided reasoning about knowledge and justifications. PhD thesis, City University of New York, 2009.
bib | .html | Abstract ]
[Pac05PLS] Eric Pacuit. A note on some explicit modal logics. In Proceedings of the 5th Panhellenic Logic Symposium, pages 117–125, Athens, Greece, July 25–28, 2005. University of Athens.
bib | .pdf | Meeting | Abstract ]
[Pac06TR] Eric Pacuit. A note on some explicit modal logics. Technical Report PP–2006–29, Institute for Logic, Language and Computation, University of Amsterdam, 2006. Published as [Pac05PLS].
bib | .pdf | Abstract ]
[Par05TARK] Rohit Parikh. Logical omniscience and common knowledge; WHAT do we know and what do WE know? In Ron van der Meyden, editor, Theoretical Aspects of Rationality and Knowledge, Proceedings of the Tenth Conference (TARK 2005), pages 62–77, Singapore, June 10–12, 2005. National University of Singapore.
bib | .pdf | Meeting | Abstract ]
[Pog10LogKCA] Francesca Poggiolesi. Towards a satisfying proof analysis of the logic of proofs. In Xabier Arrazola and María Ponte, editors, LogKCA-10, Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pages 371–385. University of the Basque Country Press, 2010.
bib | Meeting | http | Abstract ]
[PouPri14IMLA] Konstantinos Pouliasis and Giuseppe Primiero. J-Calc: A typed lambda calculus for intuitionistic justification logic. In Valeria de Paiva, Mario Benevides, Vivek Nigam, and Elaine Pimentel, editors, Proceedings of the 6th Workshop on Intuitionistic Modal Logic and Applications (IMLA 2013) in association with UNILOG 2013, Rio de Janeiro, Brazil, 7 April 2013, number 300 in Electronic Notes in Theoretical Computer Science, pages 71–87. Elsevier, January 2014.
bib | DOI | Meeting | Abstract ]
[Pri12PR] Giuseppe Primiero. Intuitionistic Logic of Proofs with dependent proof terms. Preprint NI12026-SAS, Isaac Newton Institute for Mathematical Sciences, 2012.
bib | .pdf | Abstract ]
[Pul10M] Cornelia Pulver. Self-referentiality in contraction-free fragments of modal logic S4. Master's thesis, Institute of Computer Science and Applied Mathematics, University of Bern, 2010.
bib | .pdf ]
[Ren04TR] Bryan Renne. Tableaux for the Logic of Proofs. Technical Report TR–2004001, CUNY Ph.D. Program in Computer Science, March 2004.
bib | .pdf | http | Abstract ]
[Ren05TR] Bryan Renne. Propositional games with explicit strategies. Technical Report TR–2005012, CUNY Ph.D. Program in Computer Science, October 2005.
bib | .pdf | http | Abstract ]
[Ren06ASLAPA] Bryan Renne. Games, strategies, and explicit knowledge. In 2005–06 Winter Meeting of the Association for Symbolic Logic, The Hilton New York Hotel, New York, NY, December 27–29, 2005, volume 12(3) of Bulletin of Symbolic Logic, page 513. Association for Symbolic Logic, September 2006. Abstract.
bib | JSTOR | .ps | Abstract ]
[Ren06WoLLIC] Bryan Renne. Propositional games with explicit strategies. In G. Mints and R[uy] de Queiroz, editors, Proceedings of the 13th Workshop on Logic, Language, Information and Computation (WoLLIC 2006), Stanford University, CA, USA, 18–21 July 2006, volume 165 of Electronic Notes in Theoretical Computer Science, pages 133–144. Elsevier, November 2006. Journal version published as [Ren09IC].
bib | DOI | Meeting | Abstract ]
[Ren06ESSLLIStudent] Bryan Renne. Semantic cut-elimination for two explicit modal logics. In Janneke Huitink and Sophia Katrenko, editors, Proceedings of the Eleventh ESSLLI Student Session, 18th European Summer School in Logic, Language and Information (ESSLLI'06), pages 148–158, Málaga, Spain, July 31–August 11, 2006. FoLLI.
bib | .pdf | Proceedings | Meeting | Abstract ]
[Ren06ESSLLIWRK] Bryan Renne. Bisimulation and public announcements in logics of evidence-based knowledge. In Sergei [N.] Artemov and Rohit Parikh, editors, Proceedings of the Workshop on Rationality and Knowledge, 18th European Summer School in Logic, Language and Information (ESSLLI'06), pages 112–123, Málaga, Spain, August 7–11, 2006. FoLLI.
bib | .pdf | Meeting | Abstract ]
[Ren07TR] Bryan Renne. Public communication in justification logic. Technical Report TR–2007025, CUNY Ph.D. Program in Computer Science, December 2007.
bib | .pdf | http | Abstract ]
[Ren08PhD] Bryan Renne. Dynamic Epistemic Logic with Justification. PhD thesis, City University of New York, May 2008.
bib | .pdf | .html | Abstract ]
[Ren09TARK] Bryan Renne. Evidence elimination in multi-agent justification logic. In Aviad Heifetz, editor, Theoretical Aspects of Rationality and Knowledge, Proceedings of the Twelfth Conference (TARK 2009), pages 227–236, Stanford University, California, July 6–8, 2009. ACM.
bib | DOI | .pdf | Meeting | Abstract ]
[Ren09IC] Bryan Renne. Propositional games with explicit strategies. Information and Computation, 207(10):1015–1043, October 2009. Published online April 2009.
bib | DOI | .pdf | Abstract ]
[Ren11JLC] Bryan Renne. Public communication in justification logic. Journal of Logic and Computation, 21(6):1005–1034, December 2011. Published online July 2010.
bib | DOI | Abstract ]
[Ren11SynLib] Bryan Renne. Simple evidence elimination in justification logic. In Patrick Girard, Olivier Roy, and Mathieu Marion, editors, Dynamic Formal Epistemology, volume 351 of Synthese Library, chapter 7, pages 127–149. Springer, 2011.
bib | DOI ]
[Ren12Synthese] Bryan Renne. Multi-agent justification logic: communication and evidence elimination. Synthese, 185(S1):43–82, April 2012. Published online July 2011.
bib | DOI | Abstract ]
[Rub03MT] Natalia M. Rubtsova. Logic of Proofs with substitution. Master's thesis, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, 2003. In Russian.
bib ]
[Rub06LC] N[atalia] M. Rubtsova. Evidence-based knowledge for S5. In 2005 Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '05, Athens, Greece, July 28–August 3, 2005, volume 12(2) of Bulletin of Symbolic Logic, pages 344–345. Association for Symbolic Logic, June 2006. Abstract.
bib | DOI | Meeting | .ps | Abstract ]
[Rub06JLC] Natalia [M.] Rubtsova. On realization of S5-modality by evidence terms. Journal of Logic and Computation, 16(5):671–684, October 2006.
bib | DOI | MathSciNet review | Meeting | Abstract ]
[Rub06CSR] Natalia [M.] Rubtsova. Evidence reconstruction of epistemic modal logic S5. In Dima Grigoriev, John Harrison, and Edward A. Hirsch, editors, Computer Science — Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8–12, 2006, Proceedings, volume 3967 of Lecture Notes in Computer Science, pages 313–321. Springer, 2006.
bib | DOI | Meeting | Abstract ]
[Rub06ESSLLI] Natalia [M.] Rubtsova. Semantics for justification logic corresponding to S5. In Sergei [N.] Artemov and Rohit Parikh, editors, Proceedings of the Workshop on Rationality and Knowledge, 18th European Summer School in Logic, Language and Information (ESSLLI'06), pages 124–132, Málaga, Spain, August 7–11, 2006. FoLLI.
bib | Meeting | Abstract ]
[Rub07MN] N[atalia] M. Rubtsova. Logic of Proofs with substitution. Mathematical Notes, 82(5–6):816–826, November 2007. Originally published in Russian.
bib | DOI | MathSciNet review | Abstract ]
[Sav11TABLEAUX] Yury Savateev. Sequent calculus for justifications. In Martin Giese and Roman Kuznets, editors, TABLEAUX 2011, Workshops, Tutorials, and Short Papers, number IAM–11–002 in IAM Technical Reports, page 74. Institute of Computer Science and Applied Mathematics, University of Bern, July 2011. Abstract.
bib | .pdf | Meeting | http ]
[Sav14APAL] Yury Savateev. Proof internalization in generalized Frege systems for classical logic. Annals of Pure and Applied Logic, 165(1):340–356, January 2014. Published online in August 2013.
bib | DOI | .pdf | Abstract ]
[Sch12WoLLIC] L. Menasché Schechter. A logic of plausible justifications. In Luke Ong and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3–6, 2012, Proceedings, volume 7456 of Lecture Notes in Computer Science, pages 306–320. Springer, 2012.
bib | DOI | Meeting | Abstract ]
[Sed13LFCS] Igor Sedlár. Justifications, awareness and epistemic dynamics. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 307–318. Springer, 2013.
bib | DOI | .pdf | Meeting | Abstract ]
[SedPod10LogKCA] Igor Sedlár and Juraj Podroužek. Justification logic as dynamic epistemic logic? In Xabier Arrazola and María Ponte, editors, LogKCA-10, Proceedings of the Second ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, pages 431–442. University of the Basque Country Press, 2010.
bib | Meeting | Abstract ]
[SedPod11LY] Igor Sedlár and Juraj Podroužek. Logics of Moore's paradox. In Michal Peliš and Vít Punčochář, editors, Logica Yearbook 2010, pages 211–228. College Publications, 2011.
bib | .pdf | Publisher | Meeting | Abstract ]
[Sha10PCC] Daniyar S. Shamkanov. Strong normalization and confluence for reflexive combinatory logic. In Kai Brünnler and Thomas Studer, editors, Proof, Computation, Complexity PCC 2010, International Workshop, Proceedings, number IAM–10–001 in IAM Technical Reports. Institute of Computer Science and Applied Mathematics, University of Bern, June 2010. Abstract.
bib | .pdf | Meeting | http ]
[Sha11WoLLIC] Daniyar S. Shamkanov. Strong normalization and confluence for reflexive combinatory logic. In Lev D. Beklemishev and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18–20, 2011, Proceedings, volume 6642 of Lecture Notes in Artificial Intelligence, pages 228–238. Springer, 2011.
bib | DOI | Meeting | Abstract ]
[Sha12PhD] Daniyar S. Shamkanov. Interpolation Properties of Provability Logics and Term Normalization for Reflexive Combinatory Logic. PhD thesis, Lomonosov Moscow State University, April 2012. In Russian.
bib ]
[Sid94LFCS] Tatiana [L.] Sidon. Craig interpolation property in modal logics with provability interpretation. In A[nil] Nerode and Yu. V. Matiyasevich, editors, Logical Foundations of Computer Science, Third International Symposium, LFCS'94, St. Petersburg, Russia, July 11–14, 1994, Proceedings, volume 813 of Lecture Notes in Computer Science, pages 329–340. Springer, 1994.
bib | DOI ]
[Sid97FAM] T[atiana] L. Sidon. Provability logic with operations over proofs. Fundamental and Applied Mathematics, 3(4):1173–1197, 1997. In Russian.
bib | MathSciNet review | MathNet.ru | In Russian | http | Abstract ]
[Sid97LFCS] Tatiana [L.] Sidon. Provability logic with operations on proofs. In Sergei Adian and Anil Nerode, editors, Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6–12, 1997, Proceedings, volume 1234 of Lecture Notes in Computer Science, pages 342–353. Springer, 1997.
bib | DOI | Abstract ]
[Sid97PhD] Tatiana L. Sidon. Dynamic logics of proofs with the provability operator. PhD thesis, Lomonosov Moscow State University, 1997. In Russian.
bib ]
[Sid98MUMBa] T[atiana] L. Sidon. Craig interpolation property for operational logics of proofs. Moscow University Mathematics Bulletin, 53(2):37–41, 1998. Originally published in Russian.
bib | ZMATH review | MathSciNet review | British Library ]
[Sid98MUMBb] T[atiana] L. Sidon. Nonaxiomatizability of predicate logics of proofs. Moscow University Mathematics Bulletin, 53(6):17–21, 1998. Originally published in Russian.
bib | ZMATH review | MathSciNet review | British Library ]
[SteBon14IMLA] Gabriela Steren and Eduardo Bonelli. Intuitionistic hypothetical logic of proofs. In Valeria de Paiva, Mario Benevides, Vivek Nigam, and Elaine Pimentel, editors, Proceedings of the 6th Workshop on Intuitionistic Modal Logic and Applications (IMLA 2013) in association with UNILOG 2013, Rio de Janeiro, Brazil, 7 April 2013, number 300 in Electronic Notes in Theoretical Computer Science, pages 89–103. Elsevier, January 2014.
bib | DOI | Meeting | Abstract ]
[Str93TR] Tyko Straßen. Syntactical models and fixed points for the basic logic of proofs. Technical Report iam–93–020, Institute of Computer Science and Applied Mathematics, University of Bern, 1993.
bib | .ps.gz | http | Abstract ]
[Str94PhD] Tyko Straßen. The Basic Logic of Proofs. PhD thesis, Universität Bern, April 1994.
bib | .pdf | Abstract ]
[Str94AMAI] Tyko Straßen. Syntactical models and fixed points for the basic logic of proofs. Annals of Mathematics and Artificial Intelligence, 12(3–4):291–321, December 1994.
bib | DOI | Meeting | Abstract ]
[Stu11LLP] Thomas Studer. Justification logic, inference tracking, and data privacy. Logic and Logical Philosophy, 20(4):297–306, 2011.
bib | LLP | .pdf | Abstract ]
[Stu11CIS] Thomas Studer. An application of justification logic to protocol verification. In Proceedings, 2011 Seventh International Conference on Computational Intelligence and Security, CIS 2011, pages 779–783. IEEE, 2011.
bib | DOI | .pdf | Meeting | Abstract ]
[Stu12PSI] Thomas Studer. Justified terminological reasoning. In Edmund Clarke, Irina Virbitskaite, and Andrei Voronkov, editors, Perspectives of System Informatics, 8th International Ershov Informatics Conference, PSI 2011, Novosibirsk, Russia, June 27 - July 1, 2011, Revised Selected Papers, volume 7162 of Lecture Notes in Computer Science, pages 349–361. Springer, 2012.
bib | DOI | .pdf | Meeting | Abstract ]
[Stu12LN] Thomas Studer. Lectures on justification logic. Lecture notes, November 2012.
bib | .pdf ]
[Stu13JSL] Thomas Studer. Decidability for some justification logics with negative introspection. Journal of Symbolic Logic, 78(2):388–402, June 2013.
bib | DOI | .pdf | ProjectEuclid | Abstract ]
[Wan09TR] Ren-June Wang. On proof realization on modal logic. Technical Report TR–2009003, CUNY Ph.D. Program in Computer Science, April 2009.
bib | .pdf | http | Abstract ]
[Wan09WoLLIC] Ren-June Wang. Knowledge, time, and logical omniscience. In Hiroakira Ono, Makoto Kanazawa, and Ruy de Queiroz, editors, Logic, Language, Information and Computation, 16th International Workshop, WoLLIC 2009, Tokyo, Japan, June 21-24, 2009, Proceedings, volume 5514 of Lecture Notes in Artificial Intelligence, pages 394–407. Springer, 2009. Later version published as [Wan11FI].
bib | DOI | .pdf | Meeting | Abstract ]
[Wan11FI] Ren-June Wang. Knowledge, time, and the problem of logical omniscience. Fundamenta Informaticae, 106(2–4):321–338, 2011.
bib | DOI | .pdf | Abstract ]
[Wan11TR] Ren-June Wang. Non-circular proofs and proof realization in modal logic. Technical Report TR–2011012, CUNY Ph.D. Program in Computer Science, November 2011.
bib | .pdf | http | Abstract ]
[Wan12PhD] Ren-June Wang. Timed Modal Epistemic Logic. PhD thesis, City University of New York, 2012.
bib | .pdf | .html | Abstract ]
[Wan13LFCS] Ren-June Wang. Temporalizing modal epistemic logic. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 359–371. Springer, 2013.
bib | DOI | .pdf | Meeting | Abstract ]
[TYav00LC] Tatiana Yavorskaya (Sidon). Provability logic with operations on proofs. In 1999 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '99, Utrecht, The Netherlands, August 1–6, 1999, volume 6(1) of Bulletin of Symbolic Logic, page 132. Association for Symbolic Logic, March 2000. Abstract.
bib | JSTOR | ProjectEuclid | .ps | Abstract ]
[TYav01LC] Tatiana Yavorskaya (Sidon). Logic of proof and storage predicates. In 2000 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium 2000, La Sorbonne, Paris, July 23–31, 2000, volume 7(1) of Bulletin of Symbolic Logic, pages 158–159. Association for Symbolic Logic, March 2001. Abstract.
bib | JSTOR | ProjectEuclid | Meeting | .ps | Abstract ]
[TYav01APAL] Tatiana Yavorskaya (Sidon). Logic of proofs and provability. Annals of Pure and Applied Logic, 113(1–3):345–372, December 2001.
bib | DOI | ZMATH review | MathSciNet review | Abstract ]
[TYav03LC] Tatiana Yavorskaya. Axiomatic description of operations on proofs and labels. In 2002 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium '02, Münster, Germany, August 3–9, 2002, volume 9(1) of Bulletin of Symbolic Logic, pages 118–119. Association for Symbolic Logic, March 2003. Abstract presented by title.
bib | JSTOR | ProjectEuclid | .ps | Abstract ]
[TYav05JLC] Tatiana Yavorskaya (Sidon). Negative operations on proofs and labels. Journal of Logic and Computation, 15(4):517–537, August 2005.
bib | DOI | ZMATH review | Abstract ]
[TYav05PR] Tatiana Yavorskaya (Sidon). Negative operations on proofs and labels. Preprint 239, Logic Group Preprint Series, Department of Philosophy, Utrecht University, June 2005. Later version published as [TYav05JLC].
bib | .pdf | Abstract ]
[TYav06JLC] Tatiana Yavorskaya (Sidon). Logic of Proofs and labels with a complete set of operations. Journal of Logic and Computation, 16(5):697–710, October 2006.
bib | DOI | ZMATH review | Meeting | Abstract ]
[TYav06CSR] Tatiana Yavorskaya (Sidon). Multi-agent explicit knowledge. In Dima Grigoriev, John Harrison, and Edward A. Hirsch, editors, Computer Science — Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8–12, 2006, Proceedings, volume 3967 of Lecture Notes in Computer Science, pages 369–380. Springer, 2006. Journal version published as [TYav08TOCS].
bib | DOI | Meeting | Abstract ]
[TYav08TOCS] Tatiana Yavorskaya (Sidon). Interacting explicit evidence systems. Theory of Computing Systems, 43(2):272–293, August 2008. Published online October 2007.
bib | DOI | Abstract ]
[TYavRub07JANCL] T[atiana] Yavorskaya (Sidon) and N[atalia M.] Rubtsova. Operations on proofs and labels. Journal of Applied Non-Classical Logics, 17(3):283–316, 2007.
bib | DOI | MathSciNet review | Abstract ]
[RYav00CSL] Rostislav E. Yavorsky. On the logic of the standard proof predicate. In Peter G. Clote and Helmut Schwichtenberg, editors, Computer Science Logic, 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Fischbachau, Germany, August 21–26, 2000, Proceedings, volume 1862 of Lecture Notes in Computer Science, pages 527–541. Springer, 2000.
bib | DOI | Meeting | .ps | Abstract ]
[RYav01LC] Rostislav [E.] Yavorsky. Provability logics with quantifiers on proofs. In 2000 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium 2000, La Sorbonne, Paris, July 23–31, 2000, volume 7(1) of Bulletin of Symbolic Logic, page 159. Association for Symbolic Logic, March 2001. Abstract.
bib | JSTOR | ProjectEuclid | Meeting | .ps | Abstract ]
[RYav01APAL] Rostislav E. Yavorsky. Provability logics with quantifiers on proofs. Annals of Pure and Applied Logic, 113(1–3):373–387, December 2001.
bib | DOI | ZMATH review | MathSciNet review | Meeting | .ps | Abstract ]
[RYav02AiML] Rostislav E. Yavorsky. On arithmetical completeness of first-order logics of provability. In Frank Wolter, Heinrich Wansing, Maarten de Rijke, and Michael Zakharyaschev, editors, Advances in Modal Logic, volume 3, pages 1–16. World Scientific, 2002.
bib | ZMATH review | Publisher | Meeting | .ps | Abstract ]
[RYav03Unp] R[ostislav] E. Yavorsky. Undecidability of the minimal provability logic with quantifiers on proofs. Unpublished, in Russian, November 2003.
bib | In Russian ]
[RYav03PSIM] R[ostislav] E. Yavorskij. On prenex fragment of provability logic with quantifiers on proofs. Proceedings of the Steklov Institute of Mathematics, 242(3):112–124, 2003.
bib | MathSciNet review | MathNet.ru | In Russian | Abstract ]
[RYav05JLC] Rostislav [E.] Yavorskiy. On Kripke-style semantics for the provability logic of Gödel's proof predicate with quantifiers on proofs. Journal of Logic and Computation, 15(4):539–549, August 2005.
bib | DOI | MathSciNet review | Abstract ]
[RYav05PR] Rostislav [E.] Yavorskiy. On Kripke-style semantics for the provability logic of Gödel's proof predicate with quantifiers on proofs. Preprint 238, Logic Group Preprint Series, Department of Philosophy, Utrecht University, June 2005. Later version published as [RYav05JLC].
bib | .pdf | Abstract ]
[Yu09TR] Junhua YU. Prehistoric phenomena and self-referentiality in realization procedure. Technical Report PP–2009–45, Institute for Logic, Language and Computation, University of Amsterdam, November 2009. Later version published as [Yu10CSR].
bib | .pdf | Abstract ]
[Yu10CSR] Junhua Yu. Prehistoric phenomena and self-referentiality. In Farid Ablayev and Ernst W. Mayr, editors, Computer Science — Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16–20, 2010, Proceedings, volume 6072 of Lecture Notes in Computer Science, pages 384–396. Springer, 2010. Later version published as [Yu14TOCS].
bib | DOI | Meeting | Abstract ]
[Yu13LFCS] Junhua Yu. Self-referentiality in the Brouwer–Heyting–Kolmogorov semantics of intuitionistic logic. In Sergei [N.] Artemov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6–8, 2013, Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 401–414. Springer, 2013. Later version published as [Yu14APAL].
bib | DOI | Meeting | Abstract ]
[Yu14APAL] Junhua Yu. Self-referentiality of Brouwer–Heyting–Kolmogorov semantics. Annals of Pure and Applied Logic, 165(1):371–388, January 2014. Published online in August 2013.
bib | DOI | Abstract ]
[Yu14TOCS] Junhua Yu. Prehistoric graph in modal derivations and self-referentiality. Theory of Computing Systems, 54(2):190–210, February 2014. Published online in December 2013.
bib | DOI | Abstract ]
[Zol97MUMB] E. E. Zolin. The Craig interpolation property in logics of proofs with a strong provability operator. Moscow University Mathematics Bulletin, 52(4):39–41, 1997. Originally published in Russian.
bib | ZMATH review | MathSciNet review ]

This file was generated by bibtex2html 1.96.

Compiled by Roman Kuznets, 2013