Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the definability of functionals in Gödel's theory T (1011.6353v4)

Published 29 Nov 2010 in math.LO and cs.LO

Abstract: Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for primitive recursion on objects of type tau. It is known that the functions from non-negative integers to non-negative integers that can be defined in this theory are exactly the <epsilon_0-recursive functions of non-negative integers. As an extension of this result, we show that when the domain and codomain are restricted to pure closed normal forms, the functionals of arbitrary type that are definable in T can be encoded as <epsilon_0-recursive functions.

Summary

We haven't generated a summary for this paper yet.