rkuznets

These are publications related to my study at the Graduate Center. The full list of publications as well as full-text versions of most papers can be found at http://kuznets.googlepages.com/publications

1. 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.
2. (with Vladimir Brezhnev) Making Knowledge Explicit: How Hard It Is. Technical Report TR–2005003, CUNY Ph.D. Program in Computer Science, February 2005.
3. 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.
4. 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.
5. (with Sergei Artemov) Logical Omniscience via Proof Complexity. Technical Report TR–2006005, CUNY Ph.D. Program in Computer Science, May 2006.
6. (with Vladimir Brezhnev) Making Knowledge Explicit: How Hard It Is. Theoretical Computer Science, 357(1–3):23–34, July 2006. Clifford Lectures and the Mathematical Foundations of Programming Semantics, S. Artemov and M. Mislove (eds.).
7. 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.
8. (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.
9. 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.
10. Complexity Issues in Justification Logic. PhD thesis, CUNY Graduate Center, May 2008.
11. 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.
12. Complexity through tableaux in justification logic. In Logic Colloquium 2008, Bern, Switzerland, July 3-8, Abstracts of Plenary Talks, Tutorials, Special Sessions, Contributed Talks, pp.38-39.