## 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
✦ LIBER ✦
Local induction and provably total computable functions
✍ Scribed by Cordón-Franco, Andrés; Lara-Martín, F. Félix
- Book ID
- 122309044
- Publisher
- Elsevier Science
- Year
- 2014
- Tongue
- English
- Weight
- 769 KB
- Volume
- 165
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Provably total functions of Basic Arithm
✍
Saeed Salehi
📂
Article
📅
2003
🏛
John Wiley and Sons
🌐
English
⚖ 134 KB
On Σ1-definable Functions Provably Total
✍
Teresa Bigorajska
📂
Article
📅
1995
🏛
John Wiley and Sons
🌐
English
⚖ 159 KB
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
Computable total functions on metric alg
✍
J.V. Tucker; J.I. Zucker
📂
Article
📅
2005
🏛
Elsevier Science
🌐
English
⚖ 423 KB
A Uniform Approach for Characterizing th
✍
Benjamin Blankertz; Andreas Weiermann
📂
Article
📅
1999
🏛
Springer Netherlands
🌐
English
⚖ 763 KB
On total functions, existence theorems a
✍
Nimrod Megiddo; Christos H. Papadimitriou
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 895 KB
Totally Distributed, Redundantly Structu
✍
Damsker, Dorel
📂
Article
📅
1983
🏛
IEEE
🌐
English
⚖ 251 KB