首页> 外文会议>IFIP TC 12 international conference on intelligent information processing >The Correspondence between Propositional Modal Logic with Axiom □_Φ↔◇_Φ and the Propositional Logic
【24h】

The Correspondence between Propositional Modal Logic with Axiom □_Φ↔◇_Φ and the Propositional Logic

机译:带有公理□_Φ↔◇_Φ的命题模态逻辑与命题逻辑之间的对应关系

获取原文

摘要

The propositional modal logic is obtained by adding the necessity operator □ to the propositional logic. Each formula in the propositional logic is equivalent to a formula in the disjunctive normal form. In order to obtain the correspondence between the propositional modal logic and the propositional logic, we add the axiom □_Φ↔◇_Φ to K and get a new system K~+. Each formula in such a logic is equivalent to a formula in the disjunctive normal form, where □~k(k ≥ 0) only occurs before an atomic formula p, and (-) only occurs before a pseudo-atomic formula of form □~kp. Maximally consistent sets of K~+ have a property holding in the propositional logic: a set of pseudo-atom-complete formulas uniquely determines a maximally consistent set. When a pseudo-atomic formula □~kp_i(k,i ≥ 0) is corresponding to a propositional variable q_(ki), each formula in K~+ then can be corresponding to a formula in the propositional logic P~+. We can also get the correspondence of models between K~+ and P~+. Then we get correspondences of theorems and valid formulas between them. So, the soundness theorem and the completeness theorem of K~+ follow directly from those of P~+.
机译:命题模态逻辑是通过将必要性运算符□添加到命题逻辑中而获得的。命题逻辑中的每个公式都等同于析取范式的公式。为了获得命题模态逻辑和命题逻辑之间的对应关系,我们将公理□_Φ↔◇_Φ加到K上,得到一个新的系统K〜+。这种逻辑中的每个公式都等同于析取范式的公式,其中□〜k(k≥0)仅出现在原子公式p之前,而(-)仅出现在□〜形式的伪原子公式之前kp。 K〜+的最大一致集在命题逻辑中具有属性:一组伪原子完成公式唯一确定一个最大一致集。当伪原子公式□〜kp_i(k,i≥0)对应于命题变量q_(ki)时,则K〜+中的每个公式都可以对应于命题逻辑P〜+中的公式。我们也可以得到K〜+和P〜+之间模型的对应关系。然后我们得到定理的对应关系和它们之间的有效公式。因此,K〜+的完好性定理和完备性定理直接遵循P〜+的完备性定理。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号