跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:1312.7275 · v3

Arithmetical Foundations - Recursion. Evaluation. Consistency

首次提交 2013-12-10 23:51
版本更新 2026-11-14 19:25
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

We fix constructive foundations for Arithmetic on a map theoretical, algorithmic level. In contrast to elementhood and quantification based traditional foundations such as Principia Mathematica PM, Zermelo-Fraenkel set theory ZF, or v. Neumann-Goedel-Bernays set theory NGB, our fundamental primitive recursive theory PR has as its basic "undefined" (not further defined) terms just terms for objects and maps. Goodstein's axiomatic uniqueness rules are derived as theorems in PR - with equality definability as a side result -, S is obtained by predicate comprehension, and the equivalence of the theory of partially defined maps and the categorical theory of mu-recursion identifies mu-recursive maps and while-loops with partially defined maps. Keywords: Goedel theorems, primitive recursion, categorical free-variables Arithmetic, mu-recursion, totality

作者备注:Replaces older version. Significant additions and corrections

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-14 19:25 · 最新观测版本

Arithmetical Foundations - Recursion. Evaluation. Consistency

We fix constructive foundations for Arithmetic on a map theoretical, algorithmic level. In contrast to elementhood and quantification based traditional foundations such as Principia Mathematica PM, Zermelo-Fraenkel set theory ZF, or v. Neumann-Goedel-Bernays set theory NGB, our fundamental primitive recursive theory PR has as its basic "undefined" (not further defined) terms just terms for objects and maps. Goodstein's axiomatic uniqueness rules are derived as theorems in PR - with equality definability as a side result -, S is obtained by predicate comprehension, and the equivalence of the theory of partially defined maps and the categorical theory of mu-recursion identifies mu-recursive maps and while-loops with partially defined maps. Keywords: Goedel theorems, primitive recursion, categorical free-variables Arithmetic, mu-recursion, totality

查看此版本解读 →查看此版本原文 ↗