SOME COMPLETENESS THEOREMS IN THE DYNAMIC DOXASTIC LOGIC OF ITERATED BELIEF REVISION

被引:1
|
作者
Segerberg, Krister [1 ]
机构
[1] Uppsala Univ, Dept Philosophy, S-75126 Uppsala, Sweden
来源
REVIEW OF SYMBOLIC LOGIC | 2010年 / 3卷 / 02期
关键词
D O I
10.1017/S1755020309990384
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The success of the AGM paradigm-the theory of belief change initiated by Alchourron, Gardenfors, and Makinson-is remarkable, as even a quick look at the literature it has generated will testify.(1) But it is also remarkable, at least in hindsight, how limited was the original effort. For example, the theory concerns the beliefs of just one agent; all incoming information is accepted; belief change is uniquely determined by the new information; there is no provision for nested beliefs. And perhaps most surprising: there is no analysis of iterated change. In this paper it is that last restriction that is at issue. Our medium of study is dynamic doxastic logic (DDL). The success of the AGM paradigm The particular contribution of the paper is detailed completeness proofs for three dynamic doxastic logics of iterated belief revision. The problem of extending the AGM paradigm to include iterated change has been discussed for years, but systematic discussions have appeared only recently (see Segerberg, 2007 and forthcoming, but also van Benthem, 2007; Rott, 2006; Zvesper, 2007).(2)
引用
收藏
页码:228 / 246
页数:19
相关论文
共 50 条
  • [41] Dynamic doxastic logic: why, how, and where to?
    Hannes Leitgeb
    Krister Segerberg
    Synthese, 2007, 155 : 167 - 190
  • [42] Dynamic doxastic logic: why, how, and where to?
    Leitgeb, Hannes
    Segerberg, Krister
    SYNTHESE, 2007, 155 (02) : 167 - 190
  • [43] Strong Completeness Theorems for Weak Logics of Common Belief
    Luc Lismont
    Philippe Mongin
    Journal of Philosophical Logic, 2003, 32 : 115 - 137
  • [44] Dynamic Preference Logic meets iterated belief change: Representation results and postulates characterization
    Souza, Marlo
    Vieira, Renata
    Moreira, Alvaro
    THEORETICAL COMPUTER SCIENCE, 2021, 872 : 15 - 40
  • [45] 2 THEOREMS ABOUT THE COMPLETENESS OF HOARES LOGIC
    BERGSTRA, JA
    TUCKER, JV
    INFORMATION PROCESSING LETTERS, 1982, 15 (04) : 143 - 149
  • [46] Aggregation of Trust for Iterated Belief Revision in Probabilistic Logics
    Pardo, Pere
    SCALABLE UNCERTAINTY MANAGEMENT, PROCEEDINGS, 2009, 5785 : 165 - 179
  • [47] Strong completeness theorems for weak logics of common belief
    Lismont, L
    Mongin, P
    JOURNAL OF PHILOSOPHICAL LOGIC, 2003, 32 (02) : 115 - 137
  • [48] EXTENSIONS OF MAKINSONS COMPLETENESS THEOREMS IN MODAL LOGIC
    ROUTLEY, R
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1970, 16 (03): : 239 - &
  • [49] A Semantic Account of Iterated Belief Revision in the Situation Calculus
    Schwering, Christoph
    Lakemeyer, Gerhard
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 801 - 806
  • [50] On the logic of iterated non-prioritised revision
    Booth, R
    CONDITIONALS, INFORMATION, AND INFERENCE, 2005, : 86 - 107