Abstract
Enumeration reducibility is the formalisation of the natural concept of relative enumerability between sets of natural numbers. A set A is said to be enumeration reducible to a set B iff there is some effective procedure which gives an enumeration of A from any enumeration of B. This can be shown to be equivalent to the following definition:
Definition 1.1 A set of natural numbers A is enumeration reducible (e-reducible,âĤe) to a set of natural numbers B iff there is an i such that for all x
where W i and D z are, respectively, the i th recursively enumerable set and the z th finite set in appropriate standard listing of such sets.
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
Beigel, R., Gasarch, W., Owings, J., 1987, Terse sets and verbose sets,Recursive Function Theory Newsletter, 36:367.
Case, J., 1971, Enumeration reducibility and partial degrees, Ann. Math., 2:419â439.
Chong, C.T., Minimal degrees recursive in 1-generic degrees, to appear.
Chong, C.T., Downey, R.G., On degrees bounding minimal degrees, to appear.
Chong, C.T., Jockusch, C.G., Jr., 1984, Minimal degrees and 1-generic sets below 0â, in âComputation and Proof Theoryâ, R. Richter, E. Borger, W. Oberschelp, B. Schinzel, W. Thomas, eds, Springer Lecture Notes in Mathematics 1104, Berlin, Heidelberg, New York, Tokyo.
Cohen, P.J., 1963, The independence of the continuum hypothesis, I & II,Proc. Nat. Acad. Sciences, U.S.A., 50:105â150.
Cooper, S.B., 1982, Partial degrees and the density problem,Jour. Symb. Logic, 47:854â859.
Cooper, S.B., 1984, Partial degrees and the density problem, II: the enumeration degrees of â2 sets are dense,Jour. Symb. Logic, 49:503â511.
Cooper, S.B., 1987, Enumeration reducibility using bounded information: counting minimal covers,Z. Math. Logik und Grund. der Math., 33:537â560.
Cooper, S.B., Copestake, C.S., 1988, Properly-E2 enumeration degrees, Z. Math. Logik und Grund. der Math., to appear.
Copestake, C.S., 1988, 1-genericity in the enumeration degrees,Jour. Symb. Logic, 53.
Friedberg, R., Rogers, H., Jr., 1959, Reducibility and completeness for sets of integers,Z. Math. Logik und Grund. der Math., 5:117â125.
Gutteridge, L., 1971, Some results on enumeration reducibility, Ph.D. thesis, Simon Frazer University, U.S.A..
Haught, C.A., 1985, Turing and truth table degrees of 1-generic and recursively enumerable sets. Ph.D. thesis, Cornell University, U.S.A..
Jockusch, C.G., Jr., 1980, Degrees of generic sets, in âRecursion Theory: its Generalisations and Applicationsâ, F. R. Drake, S. S. Wainer, eds, Cambridge University Press, Cambridge, London. New York, New Rochelle, Melbourne, Sydney.
Lerman, M., 1983, âDegrees of unsolvability, local and global theoryâ, Perspectives in mathematical logic, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo.
Mcevoy, K., 1985, Jumps of quasi-minimal enumeration degrees, Jour. Symb. Logic, 50:839â848.
Mcevoy, K., Cooper, S.B., 1985, On minimal pairs of enumeration degrees,Jour. Symb. Logic, 50:983â1001.
Medvedev, Yu.T., 1955, Degrees of difficulty of the mass problem, Doklady Academii Nauk SSSR, 104:501â504.
Moore, B.B., 1974, Structure of the degrees of enumeration reducibility, Ph.D. thesis, Syracuse University.
Posner, D., 1977, High degrees, Ph.D. thesis, University of California, Berkeley, U.S.A.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Âİ 1990 Plenum Press, New York
About this chapter
Cite this chapter
Copestake, C.S. (1990). 1-Generic Enumeration Degrees Below O âe . In: Petkov, P.P. (eds) Mathematical Logic. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0609-2_17
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0609-2_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-7890-0
Online ISBN: 978-1-4613-0609-2
eBook Packages: Springer Book Archive