Arithmetical Foundations - Recursion. Evaluation. Consistency
Michael Pfender
原文摘要
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
math.LO · cs.LO · math.CT