首页> 外文期刊>Journal of Philosophical Logic >Reapproaching Ramsey: Conditionals and Iterated Belief Change in the Spirit of AGM
【24h】

Reapproaching Ramsey: Conditionals and Iterated Belief Change in the Spirit of AGM

机译:重新接近拉姆齐:AGM精神的有条件和反复的信念转变

获取原文
获取原文并翻译 | 示例
           

摘要

According to the Ramsey Test, conditionals reflect changes of beliefs: α β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α (β γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals.
机译:根据Ramsey检验,条件反映了信念的变化:在信念状态下,接受α>β,而在满足α的最小修订版本中接受β时,才接受。自从Gärdenfors于1986年发表开创性论文以来,一系列不可能定理(“平凡性定理”)似乎表明,如果将Ramsey检验与AGM类型的信念修正模型结合使用,就不能对条件进行可行的分析。我认为,有可能赞同Ramsey对条件进行测试,同时忠于AGM的精神。主要关注点在于AGM的保存条件,根据该条件,原始信念集在经过修改后应通过与其保持一致的信息予以完全保留。我使用信念状态的具体表示和信念状态的(迭代)修订作为(嵌套)条件的语义模型。在四个最自然的迭代信念变化定性模型中,有两个确实可以使我们将Ramsey检验与Preservation结合起来,而该语言仅包含形式为α>β的平坦条件。然而,事实证明,对于这种简单语言而言,对于嵌套形式为α>(β>γ)的嵌套条件而言,保留违反了保留。在这样的语言中,没有两个信念集通过严格的子集包含来排序。我认为从一开始就期望保存在包含嵌套条件的语言中是正确的,这是错误的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号