首页> 外文期刊>Journal of applied non-classical logics >On the Rosser-Turquette method of constructing axiom systems for finitely many-valued propositional logics of Łukasiewicz
【24h】

On the Rosser-Turquette method of constructing axiom systems for finitely many-valued propositional logics of Łukasiewicz

机译:关于Łukasiewicz的有限多值命题逻辑的公理系统的Rosser-Turquette方法

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

摘要

A method of constructing Hilbert-type axiom systems for standard many-valued propositional logics was offered by Rosser and Turquette. Although this method is considered to be a solution of the problem of axiomatisability of a wide class of many-valued logics, the article demonstrates that it fails to produce adequate axiom systems. The article concerns finitely many-valued propositional logics of Łukasiewicz. It proves that if standard propositional connectives of the Rosser-Turquette axiom systems are definable in terms of the propositional connectives of Lukasiewicz's logics, and thus, they are normal ones, then every Rosser-Turquette axiom system for a finite-valued Lukasiewicz's logic is semantically incomplete.
机译:Rosser和Turquette提供了一种构造用于标准多值命题逻辑的Hilbert型公理系统的方法。尽管此方法被认为是解决了许多多值逻辑的公理性问题的解决方案,但本文证明了该方法无法产生足够的公理系统。本文涉及Łukasiewicz的有限多值命题逻辑。证明如果如果根据卢卡西维奇逻辑的命题连接词来定义Rosser-Turquette公理系统的标准命题连接词,因此它们是正常的,那么每个用于有限值卢卡西维奇逻辑的Rosser-Turquette公理系统都是语义上的不完整。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号