Accession Number : AD0643777
Title : CONSISTENCY PROOFS AND REPRESENTABLE FUNCTIONS. PART II. PROPERTIES OF STRONGLY REPRESENTABLE FUNCTIONS.
Descriptive Note : Technical rept.,
Corporate Author : CASE INST OF TECH CLEVELAND OHIO DEPT OF MATHEMATICS
Personal Author(s) : Kent,C. F.
Report Date : NOV 1966
Pagination or Media Count : 110
Abstract : 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)
Descriptors : (*CALCULUS OF VARIATIONS, *MATHEMATICAL LOGIC), (*RECURSIVE FUNCTIONS, THEOREMS), THEORY
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE