首页> 外文会议>Computer Science Logic >A Calculus of Realizers for EM_1 Arithmetic
【24h】

A Calculus of Realizers for EM_1 Arithmetic

机译:EM_1算法的实现器演算

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

摘要

We propose a realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without nested quantifiers, which we call EM_1-arithmetic. We interpret classical proofs as interactive learning strategies, namely as processes going through several stages of knowledge and learning by interacting with the "environment" and with each other. With respect to known constructive interpretations of classical arithmetic, the present one differs under many respects: for instance, the interpretation is compositional in a strict sense; in particular the interpretation of (the analogous of) the cut rule is the plain composition of functionals. As an additional remark, any two quantifier-free formulas provably equivalent in classical arithmetic have the same realizer.
机译:我们提出了一种无量词算术系统的可实现性解释,该系统等同于没有嵌套量词的经典算术的片段,我们称其为EM_1-算术。我们将经典证明解释为交互式学习策略,即通过与“环境”以及彼此交互而经历知识和学习几个阶段的过程。关于经典算术的已知构造解释,本发明在许多方面有所不同:例如,在严格意义上解释是组成性的;特别是对剪切规则的(类似的)解释是功能的简单组成。另外要说明的是,在经典算术中可证明等效的任何两个无量纲公式都具有相同的实现器。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号