Keywords
- Distributive Lattice
- Decision Procedure
- Truth Table
- Recursive Function
- Great Element
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ambos-Spies, K., On the structure of the recursively enumerable degrees, Dissertation, University of Munich, 1980.
Harrington, L. and Shelah, S., The undecidability of the recursively enumerable degrees (research announcement), Bull. A.M.S., 6 (1982), 79–80.
Jockush, C.G. and Mohrherr, J., Embedding the diamond lattice in the r.e. tt-degrees, to appear.
Lachlan, A.H., Initial segments of one-one degrees, Pacific J. Math. 29 (1969), 351–366.
Lachlan, A.H., Initial segments on many-one degrees, Canad. J. Math., 22 (1970), 75–85.
Lachlan, A.H., Embedding nondistributive lattices in the recursively enumerable degrees, Lecture Notes in Mathematics, No. 255, (Conference in Mathematical Logic, London, 1970), Springer-Verlag, New York, 1972, 149–177.
Lachlan, A.H., and Soare, R.I., Not every finite lattice is embeddable in the recursively enumerable degrees, Advances in Math., 37 (1980), 74–82.
Lerman, M., Degrees of unsolvability: local and global theory, Springer-Verlag, New York, 1983.
Odifreddi, P., Strong reducibilities, Bull. A.M.S. (New Series), 4 (1981), 37–86.
Pudlak, P., and Tuma, J., Every finite lattice can be embedded in a finite partition lattice, Algebra Universalis, 10 (1980), 74–95.
Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.
Shore, R.A., Finitely generated codings and the degrees r.e. in a degree d, Proc. A.M.S., 84 (1982), 256–263.
Soare, R.I., Recursively enumerable sets and degrees, Bull. A.M.S., 84 (1978), 1149–1181.
Soare, R.I., Fundamental methods for constructing recursively enumerable degrees, Lecture Notes of London Math. Soc., No. 45, (Recursion Theory: Its Generalizations and Applications, Proceedings of the Logic Colloquium '79, Leeds, August, 1979, F.R. Drake and S.S. Wainer, eds), Cambridge Univ. Press, Cambridge, 1980.
Stob., M., wtt-degrees and T-degrees of recursively enumerable sets, Journal of Sym. Logic, 48 (1983), 921–930.
Thomason, S.K., Sublattices of the recursively enumerable degrees, Z. Math. Logik Grundlagen Math., 17 (1971), 273–280.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Fejer, P.A., Shore, R.A. (1985). Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076217
Download citation
DOI: https://doi.org/10.1007/BFb0076217
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15673-4
Online ISBN: 978-3-540-39596-6
eBook Packages: Springer Book Archive
