DeepAI AI Chat
Log In Sign Up

On Rudimentarity, Primitive Recursivity and Representability

by   Saeed Salehi, et al.
Chargoon Co.

It is quite well-known from Kurt Gödel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are representable in sufficiently strong arithmetical theories. It is also known, though perhaps not as well-known as the former one, that some primitive recursive relations (and functions) are not rudimentary. We present a simple and elementary proof of this fact in the first part of this paper. In the second part, we review some possible notions of representability of functions studied in the literature, and give a new proof of the equivalence of the weak representability with the (strong) representability of functions in sufficiently strong arithmetical theories. Our results shed some new light on the notions of rudimentary, primitive recursive, and representable functions and relations, and clarify, hopefully, some misunderstandings and confusing errors in the literature.


page 1

page 2

page 3

page 4


Formalizing computability theory via partial recursive functions

We present a formalization of the foundations of computability theory in...

Foundations of self-progressive choice theories

Consider a population of agents whose choice behaviors are partially com...

Primitive Recursive Ordered Fields and Some Applications

We establish primitive recursive versions of some known facts about comp...

Pointers in Recursion: Exploring the Tropics

We translate the usual class of partial/primitive recursive functions to...

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...

An Additive Decomposition in S-Primitive Towers

We consider the additive decomposition problem in primitive towers and p...

Extraction of Efficient Programs in IΣ_1-arithmetic

Clausal Language (CL) is a declarative programming and verifying system ...