认识论空间的可信度受限修订

Kai Sauerwald
{"title":"认识论空间的可信度受限修订","authors":"Kai Sauerwald","doi":"arxiv-2409.07119","DOIUrl":null,"url":null,"abstract":"We consider credibility-limited revision in the framework of belief change\nfor epistemic spaces, permitting inconsistent belief sets and inconsistent\nbeliefs. In this unrestricted setting, the class of credibility-limited\nrevision operators does not include any AGM revision operators. We extend the\nclass of credibility-limited revision operators in a way that all AGM revision\noperators are included while keeping the original spirit of credibility-limited\nrevision. Extended credibility-limited revision operators are defined\naxiomatically. A semantic characterization of extended credibility-limited\nrevision operators that employ total preorders on possible worlds is presented.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Credibility-Limited Revision for Epistemic Spaces\",\"authors\":\"Kai Sauerwald\",\"doi\":\"arxiv-2409.07119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider credibility-limited revision in the framework of belief change\\nfor epistemic spaces, permitting inconsistent belief sets and inconsistent\\nbeliefs. In this unrestricted setting, the class of credibility-limited\\nrevision operators does not include any AGM revision operators. We extend the\\nclass of credibility-limited revision operators in a way that all AGM revision\\noperators are included while keeping the original spirit of credibility-limited\\nrevision. Extended credibility-limited revision operators are defined\\naxiomatically. A semantic characterization of extended credibility-limited\\nrevision operators that employ total preorders on possible worlds is presented.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.07119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们在认识论空间的信念变化框架中考虑可信度限制修正,允许不一致的信念集和不一致的信念。在这种无限制的情况下,可信度限制修正算子类不包括任何 AGM 修正算子。我们对可信度有限修正算子类进行了扩展,使所有 AGM 修正算子都包括在内,同时保持了可信度有限修正的原始精神。扩展的可信度受限修订运算符是按时间顺序定义的。本文提出了扩展的可信度受限修订算子的语义特征,这些算子采用了可能世界的总前序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Credibility-Limited Revision for Epistemic Spaces
We consider credibility-limited revision in the framework of belief change for epistemic spaces, permitting inconsistent belief sets and inconsistent beliefs. In this unrestricted setting, the class of credibility-limited revision operators does not include any AGM revision operators. We extend the class of credibility-limited revision operators in a way that all AGM revision operators are included while keeping the original spirit of credibility-limited revision. Extended credibility-limited revision operators are defined axiomatically. A semantic characterization of extended credibility-limited revision operators that employ total preorders on possible worlds is presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Imperative Language for Verified Exact Real-Number Computation On Randomized Computational Models and Complexity Classes: a Historical Overview Computation and Complexity of Preference Inference Based on Hierarchical Models Stability Property for the Call-by-Value $λ$-calculus through Taylor Expansion Resource approximation for the $λμ$-calculus
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1