메뉴 건너뛰기




Volumn 357, Issue 1-3, 2006, Pages 23-34

Making knowledge explicit: How hard it is

Author keywords

Logic of proofs; Modal logic; Self reference

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); FORMAL LOGIC; MODAL ANALYSIS; POLYNOMIALS; THEOREM PROVING;

EID: 33745669343     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.03.010     Document Type: Article
Times cited : (26)

References (10)
  • 1
    • 33745658678 scopus 로고    scopus 로고
    • S.N. Artemov, Operational modal logic, Technical Report MSI 95-29, Cornell University, December 1995.
  • 2
    • 0035607160 scopus 로고    scopus 로고
    • Explicit provability and constructive semantics
    • Artemov S.N. Explicit provability and constructive semantics. The Bulletin of Symbolic Logic 7 1 (2001) 1-36
    • (2001) The Bulletin of Symbolic Logic , vol.7 , Issue.1 , pp. 1-36
    • Artemov, S.N.1
  • 3
    • 33745644553 scopus 로고    scopus 로고
    • S.N. Artemov, Evidence-based common knowledge, Technical Report TR-2004018, CUNY Ph.D. Program in Computer Science, November 2004.
  • 4
    • 4344603650 scopus 로고    scopus 로고
    • Kolmogorov and Gödel's approach to intuitionistic logic: current developments
    • Artemov S.N. Kolmogorov and Gödel's approach to intuitionistic logic: current developments. Russian Math. Surveys 59 2 (2004) 203-229
    • (2004) Russian Math. Surveys , vol.59 , Issue.2 , pp. 203-229
    • Artemov, S.N.1
  • 5
    • 33745646813 scopus 로고    scopus 로고
    • S.N. Artemov, E. Nogina, Logic of knowledge with justifications from the provability perspective, Technical Report TR-2004011, CUNY Ph.D. Program in Computer Science, September 2004.
  • 6
    • 85059313921 scopus 로고
    • On the lengths of proofs in the propositional calculus (preliminary version)
    • ACM Press, New York
    • Cook S., and Reckhow R. On the lengths of proofs in the propositional calculus (preliminary version). Proc. Sixth Annu. ACM Symp. on Theory of Computing (1974), ACM Press, New York 135-148
    • (1974) Proc. Sixth Annu. ACM Symp. on Theory of Computing , pp. 135-148
    • Cook, S.1    Reckhow, R.2
  • 7
    • 33745658472 scopus 로고    scopus 로고
    • R. Feys, Modal Logics, Paris, 1965.
  • 8
    • 8644260892 scopus 로고    scopus 로고
    • The logic of proofs, semantically
    • Fitting M. The logic of proofs, semantically. Ann. Pure Appl. Logic 132 1 (2005) 1-25
    • (2005) Ann. Pure Appl. Logic , vol.132 , Issue.1 , pp. 1-25
    • Fitting, M.1
  • 9
    • 84947916318 scopus 로고    scopus 로고
    • A. Mkrtychev, Models for the logic of proofs, in: S.I. Adian, A. Nerode (Eds.), Logical Foundations of Computer Science, Fourth Internat. Symp., LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings, Lecture Notes in Computer Science, Vol. 1234, Springer, Berlin, 1997, pp. 266-275.
  • 10
    • 33745663810 scopus 로고    scopus 로고
    • A.S. Troelstra, H. Schwichtenberg. Basic Proof Theory, Cambridge Tracts in Theoretical Computer Science, Vol. 43, second ed., Cambridge University Press, Cambridge, 2000.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.