Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-10T21:08:36.856Z Has data issue: false hasContentIssue false

Abstract hierarchies and degrees

Published online by Cambridge University Press:  12 March 2014

Ljubomir L. Ivanov*
Affiliation:
Faculty of Mathematics, Sofia University, 1126 Sofia, Bulgaria

Abstract

The aim of this paper is to enrich the algebraic-axiomatic approach to recursion theory developed in [1] by an analogue to the classical arithmetical hierarchy and an abstract notion of degree. The results presented here are rather initial and elementary; indeed, the main problem was the very choice of right abstract concepts.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Ivanov, L. L., Algebraic recursion theory, Ellis Horwood, Chichester, and Halsted Press, New York, 1986.Google Scholar
[2]Ivanov, L. L., Abstract primitive recursiveness does not increase degrees (in preparation).Google Scholar
[3]Kechris, A. S. and Moschovakis, Y. N., Recursion in higher types, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 681737.CrossRefGoogle Scholar
[4]Moschovakis, Y. N., Abstract first order computability. I, II, Transactions of the American Mathematical Society, vol. 138 (1969), pp. 427–464, 465504.CrossRefGoogle Scholar
[5]Moschovakis, Y. N., On the basic notions in the theory of induction, Logic, foundations of mathematics and computability theory (proceedings of the fifth international congress of logic, methodology and philosophy of science, London, Ontario, 1975; Butts, R. E. and Hintikka, J., editors), Reidel, Dordrecht, 1977, pp. 207236.Google Scholar