Embedding Distributive Lattices Preserving 1 below a Nonzero Recursively Enumerable Turing Degree
- 159 Downloads
One way to try to gain an understanding of the various degree-theoretic structures which recursion theorists study is to see what lattices can be embedded into them. Lattice embeddings have been used to show that such structures have an undecidable theory (via embeddings as initial segments) and to show that the theory of such structures is decidable up to a certain quantifier level. Many results in recursion theory can be stated as results about lattice embeddings even if they were not originally phrased that way.
Unable to display preview. Download preview PDF.
- Ambos-Spies, K. , On the Structure of the Recursively Enumerable Degrees. PhD Thesis, University of Munich.Google Scholar
- Ambos-Spies, K. , Contiguous r.e. degrees. In Proceedings of Logic Colloquium’ 83 (Aachen), Lecture Notes in Mathematics, No. 1104, 1–37. Springer-Verlag, Berlin.Google Scholar
- Ambos-Spies, K., S. Lempp and M. Lerman, Lattice embeddings into the r.e. degrees preserving 0 and 1. To appear.Google Scholar
- Ambos-Spies, K., S. Lempp and M. Lerman, Lattice embeddings into the r.e. degrees preserving 1. To appear.Google Scholar
- Downey, R. , Notes on the 0″’-priority method with special attention to density results. In K. Ambos Spies, G.H. Müller and G.E. Sacks (eds.), Recursion Theory Week (Proc. of a Conference Held in Oberwolfach, FRG, March 19-25, 1989), Lecture Notes in Mathematics No. 1432, 114–140. Springer-Verlag, Berlin.Google Scholar
- Lachlan, A.H. , Embedding nondistributive lattices in the recursively enumerable degrees. In W. Hodges (ed.), Conference in Mathematical Logic, London, 1970, Lecture Notes in Mathematics, No. 255, 149–177. Springer-Verlag, Berlin.Google Scholar
- Shoenfield, J.R. and R.I. Soare , The generalized diamond theorem. Recursive Function Theory Newsletter, 19. Abstract Number 219.Google Scholar
- Soare, R.I. , Recursively Enumerable Sets and Degrees: The Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic, Ω Series. Springer Verlag, Berlin.Google Scholar