【24h】

Algebraic Semantics for Quasi-Nelson Logic

机译:准尼尔森逻辑的代数语义

获取原文

摘要

Quasi-Nelson logic is a generalization of Nelson logic in the sense that the negation is not necessary involutive. In this paper, we give a Hilbert-style presentation QN of quasi-Nelson logic, and show that QN is regularly BP-algebraizable with respect to its algebraic counterpart obtained by the Blok-Pigozzi algorithm, namely the class of Q-algebras. Finally, we show that the class of Q-algebras coincides with the class of quasi-Nelson algebras.
机译:准尼尔森逻辑是纳尔逊逻辑的概括,因为否定是不必要的涉及的感觉。在本文中,我们提供了Quasi-Nelson逻辑的Hilbert风格介绍QN,并表明Qn定期相对于由Blok-Pigozzi算法获得的代数对应物,即Q-Algebras的类别。最后,我们表明Q-Algebras的类与Quasi-Nelson代数的类恰逢。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号