首页> 外文期刊>Fuzzy sets and systems >Undefinability of min-conjunction in
【24h】

Undefinability of min-conjunction in

机译:最小连接的不可定义性

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

摘要

Firstly, a sufficient and necessary condition is given to decide whether the lattice operations of a WNM-chain can be definable from its other operations. Secondly, we show that it is indeed necessary to introduce the min-conjunction into MTL as a primitive connective by constructing a left-continuous t-norm such that in the propositional calculus defined by this t-norm the min-conjunction and max-disjunction are not definable from the strong conjunction, implication and truth constant 0.
机译:首先,给出了充分必要的条件来决定WNM链的晶格操作是否可以从其其他操作中定义。其次,我们表明确实有必要通过构造左连续的t范数,将min连词作为原始连接词引入MTL中,以便在由该t范数定义的命题演算中,min连词和max析取词不能从强连词,蕴涵和真常数0定义。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号