On a Theory for AC0 and the Strength of the Induction Scheme
โ Scribed by Satoru Kuroda
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 483 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
We define a fragment of Primitive Recursive Arithmetic by replacing the defining axioms for primitive recursive functions by those for functions in some specific complexity class. In this note we consider such theory for AC'. We present a model-theoretical property of this theory, by means of which we are able to characterize its provably total functions. Next we consider the problem of how strong the induction scheme can be in this theory.
๐ SIMILAR VOLUMES
We propose a symbolic-numerical method for the stability analysis of diflerence initial-value problems approximating initial-value problems for the systems of partial differential equations of hyperbolic or parabolic type. The basis of the method is constituted by the Fourier method. It is proposed