## Works by Sergei Artemov

27 found
Order:
Disambiguations
 Sergei Artemov [27] Sergei N. Artemov [6]
1. Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - 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 (...)

Export citation

Bookmark   116 citations
2. The logic of justification.Sergei Artemov - 2008 - 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 (...)

Export citation

Bookmark   87 citations
3. Justification logic.Sergei Artemov - forthcoming - Stanford Encyclopedia of Philosophy.

Export citation

Bookmark   46 citations
4. Logic of proofs.Sergei Artëmov - 1994 - Annals of Pure and Applied Logic 67 (1-3):29-59.
In this paper individual proofs are integrated into provability logic. Systems of axioms for a logic with operators “A is provable” and “p is a proof of A” are introduced, provided with Kripke semantics and decision procedure. Completeness theorems with respect to the arithmetical interpretation are proved.

Export citation

Bookmark   36 citations
5. Intuitionistic epistemic logic.Sergei Artemov & Tudor Protopopescu - 2016 - Review of Symbolic Logic 9 (2):266-298.
We outline an intuitionistic view of knowledge which maintains the original Brouwer–Heyting–Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of verification. We argue that on this view coreflectionA→KAis valid and the factivity of knowledge holds in the formKA→ ¬¬A‘known propositions cannot be false’.We show that the traditional form of factivityKA→Ais a distinctly classical principle which, liketertium non datur A∨ ¬A, does not hold intuitionistically, but, along with the whole of (...)

Export citation

Bookmark   11 citations
6. The Ontology of Justifications in the Logical Setting.Sergei N. Artemov - 2012 - 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 (...)

Export citation

Bookmark   16 citations
7. Discovering knowability: a semantic analysis.Sergei Artemov & Tudor Protopopescu - 2013 - 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 (...)

Export citation

Bookmark   10 citations
8. Logical omniscience as infeasibility.Sergei Artemov & Roman Kuznets - 2014 - Annals of Pure and Applied Logic 165 (1):6-25.
Logical theories for representing knowledge are often plagued by the so-called Logical Omniscience Problem. The problem stems from the clash between the desire to model rational agents, which should be capable of simple logical inferences, and the fact that any logical inference, however complex, almost inevitably consists of inference steps that are simple enough. This contradiction points to the fruitlessness of trying to solve the Logical Omniscience Problem qualitatively if the rationality of agents is to be maintained. We provide a (...)
No categories

Export citation

Bookmark   6 citations
9. The Basic Intuitionistic Logic of Proofs.Sergei Artemov & Rosalie Iemhoff - 2007 - 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.

Export citation

Bookmark   6 citations
10. Finite Kripke models and predicate logics of provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - 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 (...)

Export citation

Bookmark   7 citations
11. On propositional quantifiers in provability logic.Sergei N. Artemov & Lev D. Beklemishev - 1993 - Notre Dame Journal of Formal Logic 34 (3):401-419.

Export citation

Bookmark   5 citations
12. On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - 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.

Export citation

Bookmark   3 citations
13. University of Sao Paulo (Sao Paulo), Brazil, July 28–31, 1998.Sergei Artemov, Sam Buss, Edmund Clarke Jr, Heinz Dieter Ebbinghaus, Hans Kamp, Phokion Kolaitis, Maarten de Rijke & Valeria de Paiva - 1999 - Bulletin of Symbolic Logic 5 (3).

Export citation

Bookmark
14. We Will Show Them! Essays in Honour of Dov Gabbay.Sergei Artemov, H. Barringer, A. S. D'Avila Garcez, L. C. Lamb & J. Woods (eds.) - 2005 - London, U.K.: College Publications.
No categories

Export citation

Bookmark
15. 2004 Annual Meeting of the Association for Symbolic Logic.Sergei Artemov - 2005 - Bulletin of Symbolic Logic 11 (1):92-119.

Export citation

Bookmark
16. LFCS 2013.Sergei Artemov & Anil Nerode (eds.) - 2013 - Springer.

Export citation

Bookmark
17.
Export citation

Bookmark
18. (1 other version)Operations on Proofs that can be Specified by Means of Modal Logic.Sergei N. Artemov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 77-90.
No categories

Export citation

Bookmark
19. (1 other version)Of the association for symbolic logic.Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman - 2006 - Bulletin of Symbolic Logic 12 (3-4):503.

Export citation

Bookmark
20. Preface.Sergei Artemov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger & Albert Visser - 1995 - Annals of Pure and Applied Logic 75 (1-2):1.

Export citation

Bookmark
21. (2 other versions)Preface.Sergei Artemov - 2010 - Annals of Pure and Applied Logic 161 (2):119-120.

Export citation

Bookmark
22. Preface.Sergei Artemov & Anil Nerode - 2012 - Annals of Pure and Applied Logic 163 (7):743-744.

Export citation

Bookmark
23. Realization of Intuitionistic Logic by Proof Polynomials.Sergei N. Artemov - 1999 - 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 (...)

Export citation

Bookmark
24. The topology of justification.Sergei Artemov & Elena Nogina - 2008 - 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 (...)

Export citation

Bookmark
25. Preface.Yuri Matiyasevich & Sergei Artemov - 2006 - Annals of Pure and Applied Logic 141 (3):307.

Export citation

Bookmark
26. Wollic’2002.Ruy de Queiroz, Bruno Poizat & Sergei Artemov - 2005 - Annals of Pure and Applied Logic 134 (1):1-4.