首页> 外文会议>International Conference on Fuzzy Systems and Knowledge Discovery >A Prepositional Calculus Formal Deductive System SUBC With An Involutive Negation
【24h】

A Prepositional Calculus Formal Deductive System SUBC With An Involutive Negation

机译:具有涉及否定的介词微积分正式演绎系统Subc

获取原文

摘要

Residuated fuzzy logic calculi are related to continuous t-norms which are used as truth functions for the conjunction connective, and their residua as truth function for the implication. In these logics, a negation is definable from the implication and the truth constant 0, namely ﹁Φ is Φ→0. This negation behaves quite differently depending on the t-norm. For a nilpotent t-norm, it turns out that ﹁ is an involutive negation. For t-norms without non-trivial zero divisors, ﹁ is Godel negation. In this paper, we investigate the propositional calculus formal system SUBL without non-trivial zero divisors and SUBL_~ extended an involutive negation, and their completeness are proved.
机译:静置的模糊逻辑计算与连续的T-NORMS相关,其用作结合连接的真理功能,以及它们的REARGUA作为含义的真实函数。在这些逻辑中,否定是可定义的蕴涵和真相常量0,即﹁φ是φ→0。根据T-Norm,此否定表现得非常不同。对于尼利特T-Norm,事实证明,﹁是涉及持续的否定。对于没有非琐碎零浆管的T-Norms,﹁是戈德尔否定。在本文中,我们调查了没有非普通零浆管的命题微积分形式Subl,Subl_〜扩展了涉及持续的否定,并证明了它们的完整性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号