扩展命题立场逻辑的可撤销性，支持推理、立场与精化语句的灵活处理。
Extending Defeasibility for Propositional Standpoint Logics
- 融合多种可撤销逻辑机制，实现三类语句的可撤销表达
- 提出优先语义与表列演算，证明其正确性与多项式空间可解
- 适合研究非单调推理与信念更新的逻辑学者使用
本文通过整合Kraus等人的可撤销条件句、Britz与Varzinczak的可撤销必然性与可能性的概念，以及Leisegang等人的可撤销性方法，将这些思想融入Gómez Álvarez与Rudolph提出的命题立场逻辑中，构建了一个新的可撤销命题立场逻辑框架。该框架支持在蕴含式、立场模态算子及立场精化语句层面表达可撤销性。我们为其提供了优先语义，并提出了一个表列演算系统，证明其对优先蕴含关系是保真且完备的。此外，我们确定了该表列过程的计算复杂度属于PSpace。
原文摘要 · Abstract (English)
In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with Leisegang et al.'s approach to defeasibility into the standpoint logics of Gómez Álvarez and Rudolph. The resulting logical framework allows for the expression of defeasibility on the level of implications, standpoint modal operators, and standpoint-sharpening statements. We provide a preferential semantics for this extended language and propose a tableaux calculus, which is shown to be sound and complete with respect to preferential entailment. We also establish the computational complexity of the tableaux procedure to be in PSpace.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。