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
K.Ambos-Spies, Anti-mitotic recursively enumerable sets, Zeitschrift f. Math. Logik u. Grundlagen d. Mathematik, to appear.
K.Ambos-Spies, Cupping and noncapping in the r.e. wtt and Turing degrees, to appear.
K.Ambos-Spies, Automorphism bases for the r.e. degrees, to appear.
K.Ambos-Spies and P.A.Fejer, Degree theoretical splitting properties of recursively enumerable sets, to appear.
K.Ambos-Spies, C.G.Jockusch, Jr., R.A.Shore and R.I.Soare, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Trans. A.M.S., to appear.
K.Ambos-Spies and R.I.Soare, One-types of the recursively enumerable degrees, in preparation.
P.F.Cohen, Weak truth table reducibility and the pointwise ordering of 1-1 recursive functions, Thesis, Univ. Illinois Urbana-Champaign (1975)
P.A. Fejer, Branching degrees above low degrees, Trans. A.M.S. 273 (1982) 157–180
A.H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. 16 (1966) 537–569.
A.H. Lachlan, Embedding nondistributive lattices in the recursively enumerable degrees, Springer Lecture Notes Math. 255 (1972) 149–177 (Conference in Math. Logic, London 1970)
A.H. Lachlan, Bounding minimal pairs, J. Symbolic Logic 44 (1979) 626–642
R.E. Ladner, A completely mitotic nonrecursive recursively enumerable degree, Trans. A.M.S. 184 (1973) 479–507.
R.E. Ladner and L.P. Sasso, The weak truth table degrees of recursively enumerable sets, Ann. Math. Logic 4 (1975) 429–448.
R.W. Robinson, Interpolation and embedding in the recursively enumerable degrees, Ann. of Math. (2) 93 (1971) 285–314.
R.I.Soare, Fundamental methods for constructing recursively enumerable degrees, in Recursion Theory: its Generalisations and Aplications, F.R.Drake and S.S. Wainer (Ed.), Cambridge University Press, Lecture Notes 45 (1980) 1–51.
R.I.Soare, Tree arguments in recursion theory and the O'''-priority method, to appear.
M.Stob, wtt-degrees and T-degrees of recursively enumerable sets, J.Symbolic Logic, to appear.
S.K. Thomason, Sublattices of the recursively enumerable degrees, Zeitschrift f. Math. Logik u. Grundlagen d. Mathematik 17 (1971) 273–280.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Ambos-Spies, K. (1984). Contiguous R.E. Degrees. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099477
Download citation
DOI: https://doi.org/10.1007/BFb0099477
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive