CONSISTENCY PROOFS AND REPRESENTABLE FUNCTIONS. PART II. PROPERTIES OF STRONGLY REPRESENTABLE FUNCTIONS.
CASE INST OF TECH CLEVELAND OHIO DEPT OF MATHEMATICS
Pagination or Media Count:
The paper continues the study of the limitations of axiomatic systems for the expression of classical mathematical truth. Particularly, the strong representability of functions and the provability of their true properties, in classical arithmetic, is investigated. To avoid known difficulties in formalizing recursion theory, a class of recursive defining equations is used which is first, adequate for the definition of any strongly representable function and, second, allows number-theoretic deductions from the recursion equations to be replaced by theorems of arithmetic. This class is then used to establish, within arithmetic, results in the literature about arithmetic. Author
- Theoretical Mathematics