Metarecursive sets
- 1 September 1965
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 30 (3), 318-338
- https://doi.org/10.2307/2269621
Abstract
Our ultimate purpose is to give an axiomatic treatment of recursion theory sufficient to develop the priority method. The direct or abstract approach is to keep in mind as clearly as possible the methods actually used in recursion theory, and then to formulate them explicitly. The indirect or experimental approach is to look first for other mathematical theories which seem similar to recursion theory, to formulate the analogies precisely, and then to search for an axiomatic treatment which covers not only recursion theory but also the analogous theories as particular cases.The first approach is more general because it does not depend on the existence of (familiar) analogues. A concrete mathematical theory, it seems, need have no such analogues and still be important, as e.g. classical number theory. In such a case, an axiomatic treatment may still be useful for exhibiting the mathematical structure of the theory considered and the assumptions on which it rests. However, it will lack one of the most heavily advertised advantages of the axiomatic method, namely, the “economy of thought” which results from an uniform theory for several different and interesting cases: we cannot hope for this if, by hypothesis, we know of only one particular case. In contrast, the second approach, if successful at all, is bound to achieve such “economy” because we start out with several interesting particular cases. Another possible virtue of the second approach is that of field work over insight: the abstract pattern that we are looking for and hoping to formalize in axioms, may not be evident in any one mathematical theory, but may spring to the eye if one happens to look simultaneously at several theories which happen to realize the pattern.Keywords
This publication has 10 references indexed in Scilit:
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965
- The Recursively Enumerable Degrees are DenseAnnals of Mathematics, 1964
- On the Degrees Less than 0 Annals of Mathematics, 1963
- Representability of sets in formal systemsProceedings of Symposia in Pure Mathematics, 1962
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)American Journal of Mathematics, 1955
- Introduction to Metamathematics. By S. C. Kleene. Pp. x, 550, Fl. 32.50. 1952. (Noordhoff, Groningen; North-Holland Publishing Co., Amsterdam)The Mathematical Gazette, 1954
- A theorem on hypersimple setsProceedings of the American Mathematical Society, 1954
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme IMonatshefte für Mathematik, 1931