停下即完成:“知道如何”的弱逻辑（英文）

• 作 者: 李延军
• 机 构: 格罗宁根大学哲学系,
• 出 处: 逻辑学研究
• 发表日期: 2016年04期
• 关键词: knowing semantics 可判定性 公理系统 interpretation 有穷 modality proof shortest maximal

本论文针对王彦晶提出的“知道如何”的模态算子提出了一种新的语义。与原来的语义相比,我们的语义比较弱但是却更容易实现。根据该语义,主体知道如何从状态到达状态?当且仅当主体有一个有穷的线性动作系列使得执行该动作系列停止后的状态即是目的状态。这种弱化的新语义导致了一种弱化的逻辑。原来逻辑系统里面的组合公理在我们的新语义下不再有效。我们也给出了该逻辑的一个公理系统并证明了其可靠性和完全性。同时,我们也证明了该逻辑具有可判定性。

This dissertation proposes a new semantics for Wang Yanjing’s modal operator “know how ”. Compared with the original semantics, our semantics are weaker but easier to implement. According to this semantics, does the agent know how to reach the state from the state? If and only if the body has a finite series of linear actions so that the state after the series of actions are stopped is the state of destination. The new semantic weakness leads to a weakened logic. The combined axioms in the original logic system are no longer valid under our new semantics. We also give an axiom of the logic and prove its reliability and completeness. At the same time, we also prove that the logic is decidable.