Abstract
Let f:ω→ω be a total function and f̂= {〈x,y 〉: x ∈ ω& y ≤ f(x)}. A set A ⊆ ω is called bounded total if A = f̂ for some total function f. In this paper we study enumeration degrees of the bounded total sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arslanov, M.M., Cooper, S.B., Kalimullin, I.S.: The properties of the splitting of total e-degrees. Algebra i logica 43(1), 1–25 (2003)
Case, J.: Enumeration reducibility and partial degrees. Annals Math. Logic 2(4), 419–439 (1971)
Fridberg, R., Rogers, H.: Reducibility and completness for sets of integers. Z. math. Logic Grundl. Math. 5, 117–125 (1959)
Gutteridge, L.: Some results on e-reducibility, Ph.D.Diss., Burnaby (1971)
McEvoy, K.: Jumps of quasi-minimal enumeration degrees. J. Symb. Logic 50, 839–848 (1985)
Medvedev, Y.T.: Degrees of difficulty of the mass problem. Dokl. Acad. Nauk SSSR 104(4), 501–504 (1955) (Russian)
Pankratov, A.: The research of some properties of co-total e-degrees. In: Proceedings of Intern. conf. Logic and applications. Novosibirsk, p. 79 (2000) (Russian)
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Sasso, L.P.: A survey of partial degrees. J. Symb. Logic 40, 130–140 (1975)
Selman, L.: Arithmetical reducibilities. I, Z. Math. Logic Grundlag Math. 17, 335–550 (1971)
Soar Robert, I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solon, B., Rozhkov, S. (2006). Enumeration Degrees of the Bounded Total Sets. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_70
Download citation
DOI: https://doi.org/10.1007/11750321_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)