绕路归零:超越PR的函数的另一种形式化
Taking a Detour to Zero: An Alternative Formalization of Functions Beyond PR
摘要:
有两个著名的系统形式化超越原始递归的全递归(\textbf{PR}),Gödel的系统\textbf{T}和Girard和Reynolds的系统\textbf{F}。系统\textbf{T}定义了类型化对象的递归,并能构造Heyting算法(\textbf{HA})的各个函数。系统\textbf{F}引入了类型变量,可以定义系统\textbf{T}的递归。其结果是一个系统的表达作为二阶海廷算法(\textbf{HA} $_{2}$)。虽然,两者都能够表达不可否认的快速增长的功能,在某些应用中,需要更灵活的形式主义。一个这样的应用程序是CERES削减消除示意性\textbf{LK} -证明($CERES_{s}$),其中递归的形状是重要的。在本文中,我们介绍了快速增长的功能没有类型论基础的形式主义。递归由自然数的有序集合索引。我们强调了我们的递归和Winer层次结构之间的关系,以提供与现有系统的比较。我们可以证明,我们的形式表示的功能表示使用系统\textbf{T}。我们将系统\textbf{F}和以后的工作进行比较。
英文摘要:
There are two well known systems formalizing total recursion beyond primitive recursion (\textbf{PR}), system \textbf{T} by Gödel and system \textbf{F} by Girard and Reynolds. system \textbf{T} defines recursion on typed objects and can construct every function of Heyting arithmetic (\textbf{HA}). System \textbf{F} introduces type variables which can define the recursion of system \textbf{T}. The result is a system as expressive as second-order Heyting arithmetic (\textbf{HA}$_{2}$). Though, both are able to express unimaginably fast growing functions, in some applications a more flexible formalism is needed. One such application is CERES cut-elimination for schematic \textbf{LK}-proofs ($CERES_{s}$) where the shape of the recursion is important. In this paper we introduce a formalism for fast growing functions without a type theory foundation. The recursion is indexed by ordered sets of natural numbers. We highlight the relationship between our recursion and the Wainer hierarchy to provide an comparison to existing systems. We can show that our formalism expresses the functions expressible using system \textbf{T}. We leave comparison to system \textbf{F} and beyond to future work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。