The honest subrecursive classes are a lattice
Open Access
- 31 March 1974
- journal article
- Published by Elsevier in Information and Control
- Vol. 24 (3) , 247-263
- https://doi.org/10.1016/s0019-9958(74)80039-2
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Augmented loop languages and classes of computable functionsJournal of Computer and System Sciences, 1972
- A Classification of the Recursive FunctionsMathematical Logic Quarterly, 1972
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- On a subrecursive hierarchy and primitive recursive degreesTransactions of the American Mathematical Society, 1959
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958