Abstract first order computability. I, II
Open Access
- 1 January 1969
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 138, 427-464
- https://doi.org/10.1090/s0002-9947-1969-0244045-0
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 14 references indexed in Scilit:
- Recursion Theory as a Branch of Model TheoryStudies in Logic and the Foundations of Mathematics, 1968
- Hyperanalytic PredicatesTransactions of the American Mathematical Society, 1967
- Metarecursive setsThe Journal of Symbolic Logic, 1965
- A hierarchy of formulas in set theoryMemoirs of the American Mathematical Society, 1965
- Recursive Functionals and Quantifiers of Finite Types IITransactions of the American Mathematical Society, 1963
- The theory of transfinite recursionBulletin of the American Mathematical Society, 1961
- On the recursive functions of ordinal numbers.Journal of the Mathematical Society of Japan, 1960
- Recursive Functionals and Quantifiers of Finite Types ITransactions of the American Mathematical Society, 1959
- 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