Metarecursively enumerable sets and their metadegrees
- 10 October 1968
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 33 (3) , 389-411
- https://doi.org/10.2307/2270325
Abstract
Metarecursion theory is an analogue of recursion theory which deals with sets of recursive, or constructive, ordinals rather than of natural numbers. It was originated by Kreisel and Sacks [3], who make extensive use of an equation calculus developed by Kripke. We assume that the reader is acquainted with the outline of it given in [3], and especially in [3, §3].Keywords
This publication has 7 references indexed in Scilit:
- Metarecursively enumerable sets and admissible ordinalsBulletin of the American Mathematical Society, 1966
- Metarecursive setsThe Journal of Symbolic Logic, 1965
- Three theorems on the degrees of recursively enumerable setsDuke Mathematical Journal, 1965
- The Recursively Enumerable Degrees are DenseAnnals of Mathematics, 1964
- A maximal set which is not complete.The Michigan Mathematical Journal, 1964
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957