26 found
Sort by:
Disambiguations:
Sergei Artemov [23]Sergei N. Artemov [4]
  1. Sergei Artemov (forthcoming). Justification Logic. Stanford Encyclopedia of Philosophy.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Sergei Artemov & Roman Kuznets (2014). Logical Omniscience as Infeasibility. Annals of Pure and Applied Logic 165 (1):6-25.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Sergei Artemov & Anil Nerode (eds.) (2013). LFCS 2013. Springer.
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  4. Sergei Artemov & Tudor Protopopescu (2013). Discovering Knowability: A Semantic Analysis. Synthese 190 (16):3349-3376.
    In this paper, we provide a semantic analysis of the well-known knowability paradox stemming from the Church–Fitch observation that the meaningful knowability principle /all truths are knowable/, when expressed as a bi-modal principle F --> K♢F, yields an unacceptable omniscience property /all truths are known/. We offer an alternative semantic proof of this fact independent of the Church–Fitch argument. This shows that the knowability paradox is not intrinsically related to the Church–Fitch proof, nor to the Moore sentence upon which it (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Sergei N. Artemov (2012). The Ontology of Justifications in the Logical Setting. Studia Logica 100 (1-2):17-30.
    Justification Logic provides an axiomatic description of justifications and delegates the question of their nature to semantics. In this note, we address the conceptual issue of the logical type of justifications: we argue that justifications in the logical setting are naturally interpreted as sets of formulas which leads to a class of epistemic models that we call modular models . We show that Fitting models for Justification Logic naturally encode modular models and can be regarded as convenient pre-models of the (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  6. Sergei Artemov & Anil Nerode (2012). Preface. Annals of Pure and Applied Logic 163 (7):743-744.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Sergei Artemov, Yuri Matiyasevich, Grigori Mints & Anatol Slissenko (2010). Preface. Annals of Pure and Applied Logic 162 (3):173-174.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Sergei Artemov (2009). Preface. Annals of Pure and Applied Logic 161 (2):119-120.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Sergei Artemov (2008). The Logic of Justification. Review of Symbolic Logic 1 (4):477-513.
    We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  10. Sergei Artemov & Elena Nogina (2008). The Topology of Justification. Logic and Logical Philosophy 17 (1-2):59-71.
    Justification Logic is a family of epistemic logical systems obtained from modal logics of knowledge by adding a new type of formula t:F, which is read t is a justification for F. The principal epistemic modal logic S4 includes Tarski’s well-known topological interpretation, according to which the modality 2X is read the Interior of X in a topological space (the topological equivalent of the ‘knowable part of X’). In this paper, we extend Tarski’s topological interpretation from S4 to Justification Logic (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. Sergei Artemov & Rosalie Iemhoff (2007). The Basic Intuitionistic Logic of Proofs. Journal of Symbolic Logic 72 (2):439 - 451.
    The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman (2006). Of the Association for Symbolic Logic. Bulletin of Symbolic Logic 12 (3-4):503.
    Direct download  
     
    My bibliography  
     
    Export citation  
  13. Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman (2006). The Hilton New York Hotel New York, NY December 27–29, 2005. Bulletin of Symbolic Logic 12 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  14. Yuri Matiyasevich & Sergei Artemov (2006). Preface. Annals of Pure and Applied Logic 141 (3):307.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. Sergei Artemov (2005). 2004 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 11 (1):92-119.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  16. Ruy de Queiroz, Bruno Poizat & Sergei Artemov (2005). Wollic'2002. Annals of Pure and Applied Logic 134 (1):1-4.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Sergei N. Artemov (2001). Explicit Provability and Constructive Semantics. Bulletin of Symbolic Logic 7 (1):1-36.
    In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  18. Sergei N. Artemov (1999). Realization of Intuitionistic Logic by Proof Polynomials. Journal of Applied Non-Classical Logics 9 (2-3):285-301.
    ABSTRACT In 1933 Gödel introduced an axiomatic system, currently known as S4, for a logic of an absolute provability, i.e. not depending on the formalism chosen ([God 33]). The problem of finding a fair provability model for S4 was left open. The famous formal provability predicate which first appeared in the Gödel Incompleteness Theorem does not do this job: the logic of formal provability is not compatible with S4. As was discovered in [Art 95], this defect of the formal provability (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Sergei Artemov, Sam Buss, Edmund Clarke Jr, Heinz Dieter Ebbinghaus, Hans Kamp, Phokion Kolaitis, Maarten de Rijke & Valeria de Paiva (1999). University of Sao Paulo (Sao Paulo), Brazil, July 28–31, 1998. Bulletin of Symbolic Logic 5 (3).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Sergei Artëmov & Vladimir Krupski (1996). Data Storage Interpretation of Labeled Modal Logic. Annals of Pure and Applied Logic 78 (1-3):57-71.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Sergei Artemov (1995). Review: George Boolos, The Logic of Provability. [REVIEW] Journal of Symbolic Logic 60 (4):1316-1317.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Sergei Artemov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger & Albert Visser (1995). Preface. Annals of Pure and Applied Logic 75 (1-2):1.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Sergei Artëmov (1994). Logic of Proofs. Annals of Pure and Applied Logic 67 (1-3):29-59.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. Sergei Artëmov & Franco Montagna (1994). On First-Order Theories with Provability Operator. Journal of Symbolic Logic 59 (4):1139-1153.
    In this paper the modal operator "x is provable in Peano Arithmetic" is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  25. Sergei N. Artemov & Lev D. Beklemishev (1993). On Propositional Quantifiers in Provability Logic. Notre Dame Journal of Formal Logic 34 (3):401-419.
  26. Sergei Artemov & Giorgie Dzhaparidze (1990). Finite Kripke Models and Predicate Logics of Provability. Journal of Symbolic Logic 55 (3):1090-1098.
    The paper proves a predicate version of Solovay's well-known theorem on provability interpretations of modal logic: If a closed modal predicate-logical formula R is not valid in some finite Kripke model, then there exists an arithmetical interpretation f such that $PA \nvdash fR$ . This result implies the arithmetical completeness of arithmetically correct modal predicate logics with the finite model property (including the one-variable fragments of QGL and QS). The proof was obtained by adding "the predicate part" as a specific (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation