提出一套形式化假设推理的新逻辑框架,可区分事实与假设。
From Knowledge to Conjectures: A Modal Framework for Reasoning about Hypotheses
- 用模态逻辑扩展认知背景,将假设纳入推理链条
- 证明核心公理不导致逻辑崩溃,保持事实与假设的界限
- 适合研究科学推理、人工智能中的假设生成与验证
本文提出一类新的认知模态逻辑,用于形式化假设推理:在认知背景下,通过引入假设来探索其后果。不同于传统信念和知识逻辑,该系统基于一个关键公理(命题C:φ→□φ),确保已知事实在假设层中保持不变。尽管命题C常因可能引发模态坍缩而受质疑,我们证明坍缩仅在同时存在命题T或采用具体双值逻辑时才会发生。因此,我们避免命题T,采用非双值语义框架(如超值语义、弱克莱尼逻辑或描述逻辑),允许可定义命题与模态断言共存,从而防止坍缩并维持事实与假设的区分。在此基础上,定义了模态系统KC与KDC,证明其公理化直接蕴含4与5,且系统非平凡、可靠且完备。通过包含定理,建立现实、信念状态、知识状态与假设状态之间的集合包含关系,统一描述各层次联系。最后引入动态算子settle(p),形式化假设转化为现实的过程,进而推动构建假设动态逻辑。
原文摘要 · Abstract (English)
This paper introduces a new family of cognitive modal logics designed to formalize conjectural reasoning: modal systems in which cognitive contexts extend known facts with hypothetical assumptions in order to explore their consequences. Unlike traditional doxastic and epistemic systems, conjectural logics rely on a principle, called Axiom \textbf{C} ($φ\rightarrow \Boxφ$), through which established facts are preserved across conjectural layers. While Axiom \textbf{C} has often been treated with suspicion because of its association with modal collapse, we show that collapse does not arise from \textbf{C} alone, but requires either the presence of Axiom \textbf{T} or a concretely bivalent base logic. Accordingly, we avoid \textbf{T} and adopt a non-bivalent semantic framework, such as supervaluation-style semantics, Weak Kleene logic, or Description Logic, in which undefined propositions may coexist with modal assertions. This prevents modal collapse and preserves a distinction between factual and conjectural statements. Within this framework we define the modal systems $\mathbf{KC}$ and $\mathbf{KDC}$, show that Axiom \textbf{C} directly implies \textbf{4} and \textbf{5}, and prove that these systems are non-trivial, sound, and complete. An inclusion theorem links reality, doxastic states, epistemic states, and conjectural states via set-theoretic inclusion among valuations, providing a unified account of how these layers relate. Finally, we introduce a dynamic operator, $\mathsf{settle}(p)$, which formalizes the transition by which a conjectural extension becomes designated reality, thereby motivating a corresponding Conjectural Dynamic Logic.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。