首页> 外文期刊>Archive for Mathematical Logic >Normalization proof for Peano Arithmetic
【24h】

Normalization proof for Peano Arithmetic

机译:Peano算法的归一化证明

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

摘要

A proof of normalization for a classical system of Peano Arithmetic formulated in natural deduction is given. The classical rule of the system is the rule for indirect proof restricted to atomic formulas. This rule does not, due to the restriction, interfere with the standard detour conversions. The convertible detours, numerical inductions and instances of indirect proof concluding falsity are reduced in a way that decreases a vector assigned to the derivation. By interpreting the expressions of the vectors as ordinals each derivation is assigned an ordinal less than E > (0). The vector assignment, which proves termination of the procedure, originates in a normalization proof for Godel's T by Howard (Intuitionism and proof theory. North-Holland, Amsterdam, 1970).
机译:给出了自然推导公式化的经典Peano算法的归一化证明。系统的经典规则是仅限于原子公式的间接证明规则。由于有限制,该规则不会干扰标准弯路转换。减少了可转换的弯路,数值归纳和间接证明虚假的实例,从而减少了分配给该推导的向量。通过将向量的表达式解释为序数,每个导数的序数都小于E>(0)。向量分配证明了过程的终止,它源自霍华德对戈德尔T的归一化证明(直觉主义和证明理论。北荷兰,阿姆斯特丹,1970年)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号