首页> 外文期刊>Information and computation >A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
【24h】

A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

机译:概括融合可判定性的单词问题的新组合过程导致模态逻辑

获取原文
获取原文并翻译 | 示例

摘要

Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics-which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics. (c) 2006 Elsevier Inc. All rights reserved.
机译:在非不相交情况下将单词问题的决策程序组合在一起的先前结果不适用于由模态逻辑导出的方程式理论,后者对于共享布尔代数的理论也不相交。相反,模态逻辑融合的可判定性结果强烈针对当前的特殊理论,因此不能推广到其他类型的方程式理论。在本文中,我们提出了一种在不相交情况下组合单词问题的决策程序的新方法,该方法适用于模态逻辑引起的方程理论,但不仅限于此。模态逻辑的已知融合可判定性结果就是我们方法的实例。但是,即使对于由模态逻辑引起的方程式理论,我们的结果也更为笼统,因为它们并不局限于所谓的常规模态逻辑。 (c)2006 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号