On Two Models of Provability-Reference-Cited by-同舟云学术

On Two Models of Provability

Published: Issue: Volume: Page:1-52
ISSN:
Container-title:Mathematical Problems from Applied Logic II
language:
Short-container-title:

Author:

Artemov Sergei

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-69245-6_1.pdf

Reference190 articles.

1. J. Alt and S. Artemov, Reflective λ-calculus, In: Proceedings of the Dagstuhl-Seminar on Proof Theory in Computer Science, Lect. Notes Comput. Sci. 2183, Springer, 2001, pp. 22–37.

2. E. Antonakos, Justified knowledge is sufficient, Technical Report TR-2006004, CUNY Ph.D. Program in Computer Science (2006).

3. S. Artemov, Extensions of Arithmetic and Modal Logics (in Russian), Ph.D. Thesis, Moscow State University-Steklov Mathematical Insitute (1979).

4. S. Artemov, Arithmetically complete modal theories (in Russian), In: Semiotika Informatika 14, VINITI, Moscow, 1980, pp. 115–133; English transl.: S. Artemov, et al., Six Papers in Logic, Am. Math. Soc., Translations (2), 135, 1987.

5. S. Artemov, Nonarithmeticity of truth predicate logics of provability (in Russian), Dokl. Akad. Nauk SSSR 284 (1985), 270–271; English transl.: Sov. Math. Dokl. 32 (1985), 403–405.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Explicit analyses of proof/refutation interaction for constructible falsity and Heyting–Brouwer logic;Journal of Logic and Computation;2020-10-02

2. A Gödel-Artemov-Style Analysis of Constructible Falsity;Logical Foundations of Computer Science;2017-11-28

3. The Logic of Justification;Readings in Formal Epistemology;2016

4. Symmetric Logic of Proofs;Pillars of Computer Science