首页> 外文会议> >The 0-1 law fails for frame satisfiability of propositional modal logic
【24h】

The 0-1 law fails for frame satisfiability of propositional modal logic

机译:0-1定律无法满足命题模态逻辑的框架可满足性

获取原文

摘要

The digraph property KERNEL is a very simple and wellknown property studied in various areas. We previously defined a variant of this property as a counterexample of 0-1 law for the monadic existential second order logic with at most two first-order variables, over structures with 16 binary relations. Goranko and Kapron have defined two variants in frames which expresses frame satisfiability of propositional modal logic, also expressible in a small fragment of the logic above over structures with only one relation. We propose another variant of KERNEL which provides a counterexample of the 0-1 law for frame satisfiability of propositional modal logic. This refutes a result by Halpern and Kapron which establishes that the 0-1 law holds for this logic. It also strongly refines our previous counterexample.
机译:有向语属性KERNEL是一个非常简单且广为人知的属性,已在各个领域进行了研究。先前,我们针对具有16个二元关系的结构,将最多具有两个一阶变量的单子存在二阶逻辑的0-1定律的反例定义为该属性的一种变体。 Goranko和Kapron在框架中定义了两个变体,它们表示命题模态逻辑的框架可满足性,也可以在上面的逻辑的一小段中以仅一种关系表示。我们提出KERNEL的另一种变体,它为命题模态逻辑的帧可满足性提供了0-1定律的反例。这驳斥了哈珀恩(Halpern)和卡普隆(Kapron)的结果,该结果确定了0-1定律对此逻辑成立。这也极大地完善了我们先前的反例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号