Metarecursively enumerable sets and admissible ordinals
Open Access
- 1 January 1966
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 72 (1) , 59-64
- https://doi.org/10.1090/s0002-9904-1966-11416-7
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 10 references indexed in Scilit:
- MODEL-THEORETIC INVARIANTS: APPLICATIONS TO RECURSIVE AND HYPERARITHMETIC OPERATIONSPublished by Elsevier ,2014
- ON THE DEGREES LESS THAN 0′Published by World Scientific Pub Co Pte Ltd ,1999
- Metarecursive setsThe Journal of Symbolic Logic, 1965
- On the Degrees Less than 0 Annals of Mathematics, 1963
- 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
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)American Journal of Mathematics, 1955
- Recursive well-orderingsThe Journal of Symbolic Logic, 1955
- A Theorem on Hypersimple SetsProceedings of the American Mathematical Society, 1954
- 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