Two Ways to Common Knowledge

被引：8

作者：

Bucheli, Samuel ^{[1
]}

Kuznets, Roman ^{[1
]}

Studer, Thomas ^{[1
]}

机构：

[1] Univ Bern, Inst Informat & Angew Math, Bern, Switzerland

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2010年 / 262卷

基金：

瑞士国家科学基金会; 美国国家科学基金会;

关键词：

Justification logics; common knowledge; proof theory;

D O I：

10.1016/j.entcs.2010.04.007

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towards such a system. We argue that the standard induction rule is not well suited to axiomatize evidence-based common knowledge. As an alternative, we study two different deductive systems for the logic of common knowledge. The first system makes use of an induction axiom whereas the second one is based on co-inductive proof theory. We show the soundness and completeness for both systems.

引用

页码：83 / 98

页数：16

共 18 条

[1] About cut elimination for logics of common knowledge [J].

Alberucci, L ;

Jäger, G .

ANNALS OF PURE AND APPLIED LOGIC, 2005, 133 (1-3) :73-99

[2] Justified and common knowledge: Limited conservativity [J].

Antonakos, Evangelia .

LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4514 :1-11

[3]

Artemov S. N., 2009, P TARK 2009, P14

[4]

Artemov S. N., 1995, MSI9529 CORN U

[5] Justified common knowledge [J].

Artemov, Sergei .

THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) :4-22

[6] THE LOGIC OF JUSTIFICATION [J].

Artemov, Sergei .

REVIEW OF SYMBOLIC LOGIC, 2008, 1 (04) :477-513

[7] Explicit provability and constructive semantics [J].

Artemov, SN .

BULLETIN OF SYMBOLIC LOGIC, 2001, 7 (01) :1-36

[8]

Bradfield J, 2007, STUD LOGIC PRACT REA, V3, P721

[9]

Dax C, 2006, LECT NOTES COMPUT SC, V4337, P273

[10]

Fagin R., 1995, REASONING KNOWLEDGE

← 1 2 →