We prove the following theorem: Let cp(z) be a formula in the language of the theory PAof discretely ordered commutative rings with unit of the form 3 y p ' ( z , y ) with 'p' E Ao and let f, : N -+ R be such that f,(z) = y iff cp'(z, y) & (Vz < y) ~( p ' ( z , 2 ) . If ITIF I -(Vz 2 0) cp(z), then
Provably total functions of Basic Arithmetic
β Scribed by Saeed Salehi
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 134 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
It is shown that all the provably total functions of Basic Arithmetic BA, a theory introduced by Ruitenburg based on Predicate Basic Calculus, are primitive recursive. Along the proof a new kind of primitive recursive realizability to which BA is sound, is introduced. This realizability is similar to Kleene's recursive realizability, except that recursive functions are restricted to primitive recursives.
π SIMILAR VOLUMES
In part II of a series of articles on the least common multiple, the central object of investigation was a particular integer-valued arithmetic function g 1 (n). The most interesting problem there was the value distribution of g 1 (n). We proved that the counting function card[n x: g 1 (n) d ] has o
We study the graph X(n) that is de"ned as the "nite part of the quotient (n)!T, with T the Bruhat}Tits tree over % O ((1/ΒΉ )) and (n) the principal congruence subgroup of "GΒΈ(% We give concrete realizations of the ΒΈ-functions of the "nite part of the hal#ine !T for "nite unitary representations of