Selected publications ( total: 154)
- S. Artemov. `The ontology of justifications in the logical setting.' Technical Report TR-2011008, CUNY Ph.D. Program in Computer Science, 2011. To appear in the Esakia volume of Studia Logica.
- S. Artemov. `Why Do We Need Justification Logic?' Games, Norms and Reasons
Synthese Library, 2011, Volume 353, 23-38.
- S. Artemov and T. Yavorskaya. `First-Order Logic of Proofs.' Technical Report TR-2011005, CUNY Ph.D. Program in Computer Science, 2011.
- S. Artemov. `Robust Knowledge and Rationality.' Technical Report TR-2010010, CUNY Ph.D. Program in Computer Science, 2010.
- S. Artemov and M. Fitting. `Justification Logic.' Stanford Encyclopedia of Philosophy, 2011.
- S. Artemov and T. Protopopescu `Knowability From the Logical Point of View.' Technical Report TR-2010008, CUNY Ph.D. Program in Computer Science, 2010.
- S. Artemov. `Tracking Evidence.' In A. Blass, N. Dershowitz, and W. Reisig, eds., Fields of Logic and Computation:Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, Lecture Notes in Computer Science, vol. 6300, Springer-Verlag, Berlin, August 2010.
- S. Artemov. `Epistemic Logic: 5 Questions.' Vincent F. Hendricks and Olivier Roy, eds. Automatic Press/VIP, pp. 11-19, 2010.
- S. Artemov. `The impossibility of definitive solutions in some games.' Technical Report TR-2010003, CUNY Ph.D. Program in Computer Science, 2010.
- S. Artemov. `Rational decisions in non-probabilistic settings.' Technical Report TR-2009012, CUNY Ph.D. Program in Computer Science, 2009.
- S. Artemov. `Knowledge-Based Rational Decisions.' Technical Report TR-2009011, CUNY Ph.D. Program in Computer Science, 2009.
- S. Artemov and R. Kuznets. `Logical omniscience as a computational complexity problem.' In A. 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.
- S. Artemov. `The Logic of Justification.' The Review of Symbolic Logic, v.1, No.4, pp.477-513, 2008.
- S. Artemov. `Justification Logic.' In S. Hoelldobler, C. Lutz, and H. 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.
- S. Artemov. `Epistemology: 5 Questions.' Vincent F. Hendricks and Duncan Pritchard, eds. Automatic Press/VIP 2008, pp. 11-19, 2008.
- S. Artemov and E. Nogina. `Topological Semantics of
Justification Logic.' In E.A. Hirsch, A. Razborov, A. Semenov, and
A. 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, pp. 30-39. Springer, 2008.
- S. Artemov and E. Nogina. `The Topology of Justification.' Journal of Logic and Logical Philosophy/ issue devoted to the 80'th anniversary of the birth of Alexander Kuznetsov, v.17, No. 1-2, pp. 58-71, 2008.
- S. Artemov. `Symmetric Logic of Proofs.' Pillars of Computer Science. Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Lecture Notes in Computer Science, Volume 4800, pp. 58-71, 2008.
- S. Artemov and E. Bonelli. `The Intensional Lambda Calculus.' Lecture Notes in Computer Science, Springer, v. 4514, Logical Foundations of Computer Science 2007, pp. 2-18, 2007.
- S. Artemov and R. Iemhoff. `The Basic Intuitionistic Logic of Proofs.' Journal of Symbolic Logic, v. 72, No. 2, pp. 439-45, 2007.
- S. Artemov and R.Kuznets. `Logical Omniscience Via Proof Complexity.' Lecture Notes in Computer Science, Springer, v. 4207/2006, Computer Science Logic 2006, pp. 135-149, 2006.
- S. Artemov, `On Two Models of Provability.' In Mathematical Problems from Applied Logics. New Logics for the XXIst Century. II. Edited by Dov M Gabbay. International Mathematical Series, Springer, 2006.
- S. Artemov, `Modal logic in mathematics.' In P. Blackburn, et al., editors, Handbook of Modal Logic, Elsevier, pp. 927-970, 2006.
- S. Artemov. `Justified common knowledge.' Theoretical Computer Science, v. 357, pp. 4--22, 2006.
- S. Artemov and R. Iemhoff. `The basic intuitionistic logic of proofs.' Journal of Symbolic Logic, accepted for publication, 2006.
- S. Artemov and E. Nogina. `Introducing justification to epistemic
logic,' Journal of Logic and
Computation, vol. 15, No. 6, pp. 1059-1073, 2005.
- S. Artemov. `Existential semantics for modal logic,' in S.
Artemov, H. Barringer, A. d'Avila Garcez, L. Lamb and J. Woods, editors,
We Will Show Them: Essays in
Honour of Dov Gabbay. Volume 1,
College Publications, London, pp. 19-30, 2005.
- S. Artemov and E. Nogina. `On epistemic logic with
justification,' in: R. van der Meyden, editor, Theoretical Aspects of Rationality and
Knowledge. Proceedings of the Tenth Conference (TARK 2005), June 10-12,
2005, Singapore, pp. 279-294, 2005.
- S. Artemov, B. Poizat, R. de Queiroz. `Preface. WoLLIC'2002,' Annals
of Pure and Applied Logic, vol. 134, pp.1-4, 2005.
- S.Artemov (For the Program Committee). 2004 Annual Meeting of
the Association for Symbolic Logic. Carnegie Mellon University,
Pittsburgh, May 19-23, 2004. The Bulletin of Symbolic Logic,
vol.11, No.1, pp. 92-93, 2005.
- S.Artemov and E.Nogina. `Basic
epistemic logics with justifications.' Technical Report
TR-2005004, CUNY Ph.D. Program in Computer Science, 2005.
- S.Artemov and R.Iemhoff. `The
basic intuitionistic logic of proofs.' Technical Report
TR-2005002, CUNY Ph.D. Program in Computer Science, 2005.
- S. Artemov and R. Iemhoff. `From de Jongh's theorem to intuitionistic logic of proofs.'
Dick de Jongh's Festschrift, University of Amsterdam, 2004.
- S.Artemov. `Evidence-based
common
knowledge.' Technical Report TR-2004018, CUNY Ph.D. Program in
Computer Science, 2004.
- S.Artemov and L.Beklemishev. `Provability
logic.' In D. Gabbay and F. Guenthner, editors, Handbook of
Philosophical Logic, 2nd ed., volume 13, pages 229-403. Kluwer,
Dordrecht, 2004.
- S. Artemov and E. Nogina. `Logic
of knowledge with justifications from the provability perspective.'
CUNY Ph.D. Program in Computer Science, Technical Report
TR-2004011, 2004.
- Z. Adamowicz, S. Artemov, D. Niwinski, E. Orlowska, A. Romanowska
and
J. Wolenski. `Editorial.
Provinces of logic determined. Essays in the memory of Alfred Tarski,'
Annals
of Pure and Applied Logic, vol. 126, pp.3-4, 2004.
- S. Artemov. `Kolmogorov's
and Goedel's approach to intuitionistic logic: current developments,'
Russian
Mathematical Surveys, vol. 59, No.2, pp. 203-229, 2004.
- S.N. Artemov. `Kolmogorov's
and Goedel's approach to intuitionistic logic: current developments,'
Uspekhi Mat. Nauk,
vol. 59:2, pp.9-36, 2004 (in Russian).
- S. Artemov. `Embedding
of modal lambda-calculus into the Logic of Proofs,' Proceedings
of the Steklov Mathematical
Institute, vol. 242, pp. 44-58 (in Russian), 2003.
- S. Artemov. `Back
to the Future: Explicit
Logic for Computer Science,' Computer Science Logic (Springer Lecture
Notes in Computer Science vol. 2803), p. 43, 2003.
- S. Artemov. `Unified
semantics for modality and lambda-terms via proof polynomials,'
in Kees
Vermeulen and Ann Copestake eds. Algebras, Diagrams and Decisions
in Language, Logic and Computation, CSLI Publications, Stanford
University,
2002.
- J.Alt and S.Artemov. `Reflective
lambda-calculus,' In Springer Lecture Notes in
Computer Science; v. 2183, Proceedings of the Dagstuhl-Seminar on
Proof Theory
in Computer Science, 2001.
- S.Artemov and T.Sidon-Yavorskaya. `On
the first order logic of proofs,' Moscow Mathematical
Journal, vol. 1, No. 4, pp. 475-490, 2001.
- S. Artemov. `Explicit
provability and constructive semantics,' Bulletin of Symbolic
Logic, vol.
7, No.1, pp. 1-36, 2001
- S. Artemov. `Operations
on proofs that
can be specified by means of modal logic,' Advances in
Modal Logic, vol. 2, CSLI Publications, Stanford University,
pp. 59-72,
2001.
- S. Artemov, B. Kushner, G. Mints, E. Nogina, and A. Troelstra. `In
Memoriam: Albert G. Dragalin. 1941-1998,' Bulletin of Symbolic
Logic. vol. 5, No. 3, pp. 389-391, 1999
- S.Artemov, E.Kazakov and D.Shapiro. `On
logic of knowledge with justifications,' Technical Report CFIS
99-12, Cornell University, 1999.
- S. Artemov. `Understanding
Constructive
Semantics,' Spinoza Lecture for European Association for Logic,
Language and Information, Utrecht, August 1999.
- S. Artemov. `Uniform
provability realization of intuitionistic logic, modality and
lambda-terms,' Electronic
Notes on Theoretical Computer Science v. 23, No. 1, 1999.
- S. Artemov. `Deep
isomorphism
of modal derivations and lambda-terms,' Technical Report CFIS
99-07, Cornell University, 1999. Proceedings of the Workshop
Intuitionistic
Modal Logic and Applications, Trento, Italy, 1999.
- S. Artemov. Preface to L. Beklemishev, M. Pentus, K.
Vereshchagin `Provability,
Complexity, Grammars.' American Mathematical Society
Translations, series 2, vol. 192, 1999.
- S. Artemov. `On
explicit reflection in theorem proving and formal verification,' in
Springer Lecture
Notes in Artificial Intelligence v. 1632 , Automated
Deduction - CADE-16. Proceedings of the 16th International Conference
on Automated
Deduction, Trento, Italy, July 1999, pp. 267-281, 1999.
- S. Artemov. `Realization of Intuitionistic Logic by Proof
Polynomials,'
Journal of Applied Non-Classical Logics, vol. 9, No. 2-3, pp. 285-302,
1999.
- S. Artemov. `Explicit
Modal Logic,' Workshop Proceedings Advances in Modal Logic,
vol. 2, Uppsala, 1998, Technical Report CFIS 98-17, Cornell
University, 1998.
- S. Artemov. `Explicit
provability: the intended semantics for intuitionistic and modal logic,'
Technical
Report CFIS 98-10, Cornell University, 1998.
- S. Artemov. `Logic
of proofs: a
unified semantics for modality and lambda-terms,' Technical
Report CFIS 98-06, Cornell University, 1998.
- S. N. Artemov, J.M. Davoren, and A. Nerode. `Logic,
topological semantics and hybrid systems,' in Proceedings of the 36th
International Conference on Decision and Control, CDC'97. 1997, pp.
698–701, IEEE Press.
- S. Artemov, J. Davoren and A. Nerode. `Modal
logics and topological semantics for Hybrid Systems,' Technical
Report MSI 97-05, Cornell University, 1997.
- S. Artemov, J. Davoren and A. Nerode. `Topological semantics for
and
Hybrid Systems,' in Springer Lecture Notes in Computer Science;
vol. 1234, Proceedings of the 4th International Symposium on Logical
Foundations
of Computer Science, LFCS'97, pp. 1-8, 1997.
- S. Artemov. `Proof
realizations
of the typed lambda-calculi,' Technical Report MSI 97-02, Cornell
University, 1997.
- S. Artemov and V. Krupski. `Data
storage interpretation of labeled modal logic,' Annals of Pure
and Applied
Logic, vol. 78, pp. 57-71, 1996.
- S. Artemov and A. Chuprina. `Logic of proofs with complexity
operators,' in
P. Agiano and A. Ursini eds, Logic
and Algebra, Lecture Notes in Pure and Applied Mathematics, Marcel
Dekker, Inc. New York, 1996.
- S. Artemov. `Proof
realization of intuitionistic and modal logics,' Technical Report
MSI 96-06, Cornell
University, 1996.
- S. Artemov. `Operational
modal logic,' Technical Report MSI 95-29, Cornell University, 1995.
- S. Artemov, G. Boolos, E. Engeler, S. Feferman, G. Jager and A.
Visser.
`Preface,' Annals of Pure and Applied Logic, vol. 75, No. 1,
pp. 1-2, 1995. Special issue of papers from the Conference on Proof
Theory, Provability Logic and
Computation, Berne, Switzerland, 20-24 March 1994.
- S. Artemov. `Logic
of Proofs,' Annals of Pure and Applied Logic, vol. 67, No.
2, pp. 29-59, 1994.
- S. Artemov and V. Krupski. `Referential data structures and
labeled
modal logic,' in Springer Lecture Notes in Computer Science;
vol. 813, Proceedings of the 3th International Symposium on Logical
Foundations
of Computer Science, LFCS'94, pp. 23-33, 1994.
- S. Artemov and F. Montagna. `On first order theories with
provability
operator,' Journal of Symbolic Logic, vol. 59, No. 4, 1994.
- S. Artemov and A. Chuprina. `Logic of proofs with complexity
operators,' Technical Report ML-1994-07, ILLC University of Amsterdam, 1994.
- S. Artemov. `On propositional quantifiers in Provability Logic,
Logic
Colloquium'91,' Journal of Symbolic Logic, vol. 58, No. 2, pp.
743-744, 1993.
- S. Artemov and T. Strassen. `The logic of the Godel proof
predicate,' Lecture Notes in Computer Science, vol. 713, pp.
71-82, Springer-Verlag,
1993.
- S. Artemov and T. Strassen. `The Basic Logic of Proofs,' Lecture
Notes in Computer Science, vol. 702, pp. 14-28, Springer-Verlag,
1993.
- S. Artemov and L. Beklemishev. `On
propositional quantifiers in Provability
Logic,' Notre Dame Journal of Formal Logic, vol. 34, No. 3,
pp. 401-419, 1993.
- S. Artemov. `Uniform arithmetical completeness of modal
provability logics,' Matematicheskie Zametki, vol. 48, No. 1,
pp. 3-10, 1990 (Russian);
English transl.: Soviet Math. Notes, vol. 48, No. 1-2, 625-629,
1991.
- S. Artemov. `Kolmogorov logic of problems and a provability
interpretation
of intuitionistic logic,' in Theoretical Aspects of Reasoning about
Knowledge - III Proceedings, Morgan Kaufman Pbl., pp.257-272, 1990.
- S. Artemov and G.K. Dzhaparidze. `Finite Kripke models and
predicate logics of provability,' Journal of Symbolic Logic,
vol. 55, No. 3,
pp. 1090-1098, 1990.
- S. Artemov. `Degrees of undecidability of extensions of
arithmetic by
true statements,' Uspekhi Mat. Nauk., vol. 43, No. 2(260), pp.
127-128, 1988 (Russian); English transl.: Russian Math. Surveys,
vol. 43, No.
2, pp. 159-160, 1988.
- S. Artemov and G.K. Dzhaparidze. `Effective predicate logics of
provability,'
Doklady AN SSSR, vol. 297, No. 3, pp. 521-523, 1987.
(Russian); English transl.: Soviet Math. Doklady, vol. 36, No.
3, pp. 478-480, 1987.
- S. Artemov. `Superintuitionistic logics having a provability
interpretation,' Doklady AN SSSR, vol. 291, No. 6, pp.
1289-1291, 1986 (Russian); English
transl.: Soviet Math. Doklady, vol. 34, No. 3, pp. 596-598,
1987.
- S. Artemov. `Numerically correct provability logics,' Doklady
AN
SSSR, vol. 290, No. 6, pp. 1289-1292, 1986 (Russian); English
transl.: Soviet Math. Doklady, vol. 34, No. 2, pp. 384-387,
1987.
- S. Artemov et al. Six Papers in Logic, American
Mathematical Society Translations, series 2, vol. 135, 1987.
- S. Artemov. `Modal logics axiomatizing provability,' Izvestiya
AN SSSR, ser. matem., vol. 49, No. 6, pp. 1123-1154, 1985
(Russian); English
transl.: Math USSR Izvestiya, vol. 27, No. 2, pp. 401-429, 1986.
- S. Artemov. `Non-arithmeticity of truth predicate logics of
provability,'
Doklady AN SSSR, vol. 284, No. 2, pp. 270-271, 1985
(Russian); English transl.: Soviet Math. Doklady, vol. 32, No.
2, pp. 403-405, 1985.
- S. Artemov. `Arithmetically complete modal theories,' Semiotika
i Informatika, Moscow, vol. 14, pp. 115-133, 1980 (Russian)