首页> 外文期刊>Soft computing: A fusion of foundations, methodologies and applications >An algebraic study of Peterson's Intermediate Syllogisms
【24h】

An algebraic study of Peterson's Intermediate Syllogisms

机译:彼得森中级三段论的代数研究

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

摘要

Peterson's Intermediate Syllogisms, generalizing Aristotelian syllogisms by intermediate quantifiers 'Many', 'Most' and 'Almost all', are studied. It is demonstrated that, by associating certain values V, W and U on standard ?ukasiewicz MV-algebra with the first and second premise and the conclusion, respectively, the validity of a corresponding intermediate syllogism is determined by a simple MV-algebra (in-)equation. Possible conservative extensions of Peterson's system are discussed. Finally it is shown that Peterson's bivalued intermediate syllogisms can be viewed as fuzzy theories in Pavelka's fuzzy propositional logic, i.e. a fuzzy version of Peterson's Intermediate Syllogisms is introduced.
机译:研究了彼得森的中间三段论,通过中间量词“很多”,“最多”和“几乎所有”概括了亚里士多德的三段论。证明了通过将标准Fukasiewicz MV-代数上的某些值V,W和U分别与第一和第二前提和结论相关联,相应的中间三段论的有效性由一个简单的MV-代数(在-)方程。讨论了彼得森系统的可能保守扩展。最后表明,彼得森的双值中间三段论可以被视为帕维尔卡的模糊命题逻辑中的模糊理论,即介绍了彼得森中间三段论的模糊版本。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号