default search action
Sergei N. Artëmov
Person information
- affiliation: City University of New York, New York City, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j36]Sergei Artemov:
Towards Syntactic Epistemic Logic. Fundam. Informaticae 186(1-4): 45-62 (2022) - [j35]Sergei Artemov, Anil Nerode:
Editorial. J. Log. Comput. 32(8): 1486 (2022) - [e9]Sergei N. Artëmov
, Anil Nerode:
Logical Foundations of Computer Science - International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings. Lecture Notes in Computer Science 13137, Springer 2022, ISBN 978-3-030-93099-8 [contents] - [i2]Sergei Artemov:
Towards Syntactic Epistemic Logic. CoRR abs/2205.13145 (2022) - 2021
- [j34]Valeria de Paiva, Sergei Artemov:
Preface to Intiutionistic Modal Logic 2017. FLAP 8(8): 2261-2264 (2021) - [j33]Sergei N. Artëmov, Anil Nerode:
Editorial. J. Log. Comput. 31(1): 1 (2021) - 2020
- [j32]Sergei N. Artëmov, Anil Nerode:
Special Issue on Logical Foundations of Computer Science. J. Log. Comput. 30(1): 1 (2020) - [j31]Sergei N. Artëmov:
On aggregating probabilistic evidence. J. Log. Comput. 30(1): 61-76 (2020) - [j30]Sergei N. Artëmov, Anil Nerode:
Editorial. J. Log. Comput. 30(8): 1429 (2020) - [j29]Sergei N. Artëmov:
Justification awareness. J. Log. Comput. 30(8): 1431-1446 (2020) - [c22]Sergei N. Artëmov
Observable Models. LFCS 2020: 12-26 - [e8]Sergei N. Artëmov
Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings. Lecture Notes in Computer Science 11972, Springer 2020, ISBN 978-3-030-36754-1 [contents]
2010 – 2019
- 2018
- [c21]Sergei N. Artëmov
Justification Awareness Models. LFCS 2018: 22-36 - [e7]Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science - International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings. Lecture Notes in Computer Science 10703, Springer 2018, ISBN 978-3-319-72055-5 [contents] - 2017
- [i1]Sergei N. Artëmov:
Epistemic Modeling with Justifications. CoRR abs/1703.07028 (2017) - 2016
- [j28]Sergei N. Artëmov, Tatiana Yavorskaya:
Binding modalities. J. Log. Comput. 26(1): 451-461 (2016) - [j27]Sergei N. Artëmov, Tudor Protopopescu
Intuitionistic Epistemic Logic. Rev. Symb. Log. 9(2): 266-298 (2016) - [c20]Sergei N. Artëmov:
On Aggregating Probabilistic Evidence. LFCS 2016: 27-42 - [e6]Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings. Lecture Notes in Computer Science 9537, Springer 2016, ISBN 978-3-319-27682-3 [contents] - 2014
- [j26]Sergei N. Artëmov, Roman Kuznets
Logical omniscience as infeasibility. Ann. Pure Appl. Log. 165(1): 6-25 (2014) - [p2]Sergei N. Artëmov:
On Definitive Solutions of Strategic Games. Johan van Benthem on Logic and Information Dynamics 2014: 487-507 - 2013
- [j25]Sergei N. Artëmov, Tudor Protopopescu
Discovering knowability: a semantic analysis. Synth. 190(16): 3349-3376 (2013) - [e5]Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings. Lecture Notes in Computer Science 7734, Springer 2013, ISBN 978-3-642-35721-3 [contents] - 2012
- [j24]Sergei N. Artëmov, Anil Nerode:
Preface. Ann. Pure Appl. Log. 163(7): 743-744 (2012) - [j23]Sergei N. Artëmov:
The Ontology of Justifications in the Logical Setting. Stud Logica 100(1-2): 17-30 (2012) - 2010
- [j22]Sergei N. Artëmov, Yuri V. Matiyasevich
Preface. Ann. Pure Appl. Log. 162(3): 173-174 (2010) - [j21]Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Preface. Theory Comput. Syst. 46(1): 1 (2010) - [j20]Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov:
Preface. Theory Comput. Syst. 46(4): 619 (2010) - [c19]Sergei N. Artëmov:
Tracking Evidence. Fields of Logic and Computation 2010: 61-74
2000 – 2009
- 2009
- [j19]Sergei N. Artëmov:
Preface. Ann. Pure Appl. Log. 161(2): 119-120 (2009) - [j18]Sergei N. Artëmov:
Preface. Ann. Pure Appl. Log. 161(3): 251-252 (2009) - [c18]Sergei N. Artëmov, Roman Kuznets
Logical omniscience as a computational complexity problem. TARK 2009: 14-23 - [e4]Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science 5407, Springer 2009, ISBN 978-3-540-92686-3 [contents] - 2008
- [j17]Sergei N. Artëmov, Volker Diekert, Dima Grigoriev:
Foreword. Theory Comput. Syst. 43(2): 99 (2008) - [j16]Sergei N. Artëmov:
The Logic of Justification. Rev. Symb. Log. 1(4): 477-513 (2008) - [c17]Sergei N. Artëmov:
Symmetric Logic of Proofs. Pillars of Computer Science 2008: 58-71 - [c16]Sergei N. Artëmov, Elena Nogina:
Topological Semantics of Justification Logic. CSR 2008: 30-39 - [c15]Sergei N. Artëmov:
Justification Logic. JELIA 2008: 1-4 - 2007
- [j15]Sergei N. Artëmov, Rosalie Iemhoff:
The basic intuitionistic logic of proofs. J. Symb. Log. 72(2): 439-451 (2007) - [c14]Sergei N. Artëmov, Eduardo Bonelli:
The Intensional Lambda Calculus. LFCS 2007: 12-25 - [p1]Sergei N. Artëmov:
Modal logic in mathematics. Handbook of Modal Logic 2007: 927-969 - [e3]Sergei N. Artëmov, Anil Nerode:
Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings. Lecture Notes in Computer Science 4514, Springer 2007, ISBN 978-3-540-72732-3 [contents] - 2006
- [j14]Yuri V. Matiyasevich
Preface. Ann. Pure Appl. Log. 141(3): 307 (2006) - [j13]Sergei N. Artëmov, Michael W. Mislove
Preface. Theor. Comput. Sci. 357(1-3): 1-3 (2006) - [j12]Sergei N. Artëmov:
Justified common knowledge. Theor. Comput. Sci. 357(1-3): 4-22 (2006) - [c13]Sergei N. Artëmov, Roman Kuznets
Logical Omniscience Via Proof Complexity. CSL 2006: 135-149 - 2005
- [j11]Ruy J. G. B. de Queiroz, Bruno Poizat, Sergei N. Artëmov:
WoLLIC'2002. Ann. Pure Appl. Log. 134(1): 1-4 (2005) - [j10]Sergei N. Artëmov, Elena Nogina:
Introducing Justification into Epistemic Logic. J. Log. Comput. 15(6): 1059-1073 (2005) - [c12]Sergei N. Artëmov:
Existential Semantics for Modal Logic. We Will Show Them! (1) 2005: 19-30 - [c11]Sergei N. Artëmov, Elena Nogina:
On epistemic logic with justification. TARK 2005: 279-294 - [e2]Sergei N. Artëmov, Howard Barringer, Artur S. d'Avila Garcez, Luís C. Lamb, John Woods:
We Will Show Them! Essays in Honour of Dov Gabbay, Volume One. College Publications 2005, ISBN 1-904987-25-7 [contents] - [e1]Sergei N. Artëmov, Howard Barringer, Artur S. d'Avila Garcez, Luís C. Lamb, John Woods:
We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two. College Publications 2005, ISBN 1-904987-26-5 [contents] - 2004
- [j9]Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska
Editorial. Ann. Pure Appl. Log. 126(1-3): 3-4 (2004) - 2003
- [c10]Sergei N. Artëmov:
Back to the Future: Explicit Logic for Computer Science (Invited Lecture). CSL 2003: 43 - 2001
- [j8]Sergei N. Artëmov:
Explicit provability and constructive semantics. Bull. Symb. Log. 7(1): 1-36 (2001) - [c9]Jesse Alt, Sergei N. Artëmov:
Reflective lambda-Calculus. Proof Theory in Computer Science 2001: 22-37
1990 – 1999
- 1999
- [j7]Sergei N. Artëmov:
Realization of Intuitionistic Logic by Proof Polynomials. J. Appl. Non Class. Logics 9(2-3): 285-301 (1999) - [c8]Sergei N. Artëmov:
On Explicit Reflection in Theorem Proving and Formal Verification. CADE 1999: 267-281 - [c7]Sergei N. Artëmov:
Uniform provability realization of intuitionistic logic, modality and lambda-terms. Realizability Semantics and Applications@FLoC 1999: 3-12 - 1998
- [c6]Sergei N. Artëmov:
Operations on Proofs that can be Specified by Means of Modal Logic. Advances in Modal Logic 1998: 59-72 - 1997
- [c5]Sergei N. Artëmov, Jennifer M. Davoren, Anil Nerode:
Topological Semantics for Hybrid Systems. LFCS 1997: 1-8 - 1996
- [j6]Sergei N. Artëmov, Vladimir Krupski:
Data Storage Interpretation of Labeled Modal Logic. Ann. Pure Appl. Log. 78(1-3): 57-71 (1996) - 1995
- [j5]Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser:
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. Ann. Pure Appl. Log. 75(1-2): 1 (1995) - 1994
- [j4]Sergei N. Artëmov:
Logic of Proofs. Ann. Pure Appl. Log. 67(1-3): 29-59 (1994) - [j3]Sergei N. Artëmov, Franco Montagna:
On First-Order Theories with Provability Operator. J. Symb. Log. 59(4): 1139-1153 (1994) - [c4]Sergei N. Artëmov, Vladimir Krupski:
Referential Data Structures and Labeled Modal Logic. LFCS 1994: 23-33 - 1993
- [j2]Sergei N. Artëmov, Lev D. Beklemishev
On propositional quantifiers in provability logic. Notre Dame J. Formal Log. 34(3): 401-419 (1993) - [c3]Sergei N. Artëmov, Tyko Straßen:
The Logic of the Gödel Proof Predicate. Kurt Gödel Colloquium 1993: 71-82 - 1992
- [c2]Sergei N. Artëmov, Tyko Straßen:
The Basic Logic of Proofs. CSL 1992: 14-28 - 1990
- [j1]Sergei N. Artëmov, Giorgie Dzhaparidze:
Finite Kripke Models and Predicate Logics of Provability. J. Symb. Log. 55(3): 1090-1098 (1990) - [c1]Sergei N. Artëmov:
Kolmogorov's Logic of Problems and a Provability Interpretation of Intuitionistic Logic. TARK 1990: 257-272
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: