- Self-Referential Justifications in Epistemic Logic. Theory of Computing Systems. Online First, April 2009.
[pdf with corrected typos] © Springer Science+Business Media, LLC 2009.
Errata to the official journal version can be found here.
- (with Samuel R. Buss) The NP-Completeness of Reflected Fragments of Justification Logics. In Sergei 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.
[pdf] © Springer-Verlag Berlin Heidelberg 2009 - Complexity through tableaux in justification logic. Bulletin of Symbolic Logic, 15(1):121, March 2009. Abstract from Proceedings of 2008 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium'08, Bern, Switzerland, July 3-8, 2008.
Also available in pdf-format in the meeting's proceedings booklet, pp.38-39.
© 2009, Association for Symbolic Logic
- 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.
© Springer-Verlag Berlin Heidelberg 2008 - Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center, May 2008.
[pdf] © 2008, 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.
[pdf] © Springer-Verlag Berlin Heidelberg 2007 - (with Sergei Artemov) 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.
[pdf] © Springer-Verlag Berlin Heidelberg 2006 - Complexity of Evidence-Based Knowledge. In Sergei Artemov and Rohit Parikh, editors, Proceedings of the Workshop on Rationality and Knowledge, 18th European Summer School in Logic, Language, and Information, 7-11 August 2006,
Universidad de Málaga, pages 66-75, 2006.
[pdf] © 2006, Roman Kuznets
- (with Vladimir Brezhnev) Making Knowledge Explicit: How Hard It Is. Theoretical Computer Science,
357(1-3):23-34, July 2006.
[pdf] © 2006 Elsevier B.V. - (with Sergei Artemov) Logical Omniscience via Proof Complexity. Technical Report TR-2006005, CUNY Ph.D. Program in Computer Science, May 2006.
[pdf]
A later version is published in Proceedings of CSL 2006 in Lecture Notes in Computer Science.
- On self-referentiality in modal logic. Bulletin of Symbolic Logic, 12(3):510, September 2006. Abstract from Proceedings of 2005-06 Winter Meeting of the Association for Symbolic Logic, The Hilton New York Hotel, New York, NY, December 27-29, 2005.
© 2006, Association for Symbolic Logic - Logic of Proofs as a measure of Hilbert-style proof complexity. Bulletin of Symbolic Logic, 12(2):355, June 2006. Abstract presented by title from Proceedings
of 2005 Summer Meeting of the Association for Symbolic Logic, Logic
Colloquium'05, Athens, Greece, July 28-August 3, 2005.
© 2006, Association for Symbolic Logic - (with Vladimir Brezhnev) Making Knowledge Explicit: How Hard It Is. Technical Report TR-2005003, CUNY Ph.D. Program in Computer Science, February 2005.
[pdf]
A later version is published in Theoretical Computer Science.
- On decidability of the logic of proofs with arbitrary constant specifications. Bulletin of Symbolic Logic, 11(1):111, March 2005. Abstract from Proceedings
of 2004 Annual Meeting of the Association for Symbolic Logic, Carnegie Mellon University, Pittsburgh, PA, May 19-23, 2004.
Also available in pdf-format here.
© 2005, Association for Symbolic Logic
- 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.
[pdf] © Springer-Verlag Berlin Heidelberg 2000
Errata to this paper are published in Proceedings of Logic Colloquium 2008.
Unpublished