The II3-theory of the computably enumerable turing degrees is undecidable

Transactions of the American Mathematical Society

Volumn 350, Issue 7, 1998, Pages 2719-2736

  Lempp, Steffen ^a   Nies, André ^b   Slaman, Theodore A ^c  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computably; Fragment of first order theory; Iis theory; Recursively enumerable degrees; Undecidability

Indexed keywords

EID: 22044445793     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0002-9947-98-01800-5     Document Type: Article

References (15)

1. [AS93] K. Ambos-Spies and R. A. Shore, Undecidability and one-types in the recursively enumerable degrees, Ann. Pure Appl. Logic 63 (1993), 3-37. MR 94g:03082
2. [HS82] L. Harrington and S. Shelah, The undecidability of the recursively enumerable degrees, Bull. AMS (N. S.) 6 (1982), 79-80. MR 831:03067
3. [HSta] L. Harrington and T.A. Slaman, unpublished.
4. [La66] A. H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. (3) 16 (1966), 537-569. MR 34:4126
5. [LLta] S. Lempp and M. Lerman, A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees, Ann. Pure Appl. Logic (to appear).
6. [Le96] M. Lerman, Embeddings into the recursively enumerable degrees, Computability, Enumerability, Unsolvability: Directions in Recursion Theory (S. B. Cooper et al., eds.), London Math. Soc. Lecture Note Ser., no. 224, Cambridge Univ. Press, Cambridge, 1996, pp. 185-204. MR 97a:03003
7. [LN195] S. Lempp, A. Nies, The undecidability of the Tl-theory of the r.e. wtt and Turing degrees, J. Symbolic Logic 60 (1995), 1118-1136. MR 97f:03062
8. [Ni96] A. Nies, Undecidable fragments of elementary theories, Algebra Universalis 35 (1996), 8-33. MR 96k:03099
9. [Po44] E. L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. AMS 50 (1944), 284-316. MR 6:29f
10. [Sa63] G. E. Sacks, Degrees of Unsolvability, Ann. of Math. Studies No. 55, Princeton University Press, Princeton, N.J., 1963. MR 32:4013
11. [SaG4] G. E. Sacks, The recursively enumerable degrees are dense, Annals of Math. (2) 80 (1964), 300-312. MR 29:3367
12. [Sh65] J. R. Shoenfield, Application of model theory to degrees of Unsolvability, Symposium on the Theory of Models (J. Addison, L. Henkin, A. Tarski, eds.), North-Holland, Amsterdam, 1965, pp. 359-363. MR 34:53
13. [SSta] T. A. Slaman and R. I. Soare, Extension of embeddings in the computably enumerable degrees (to appear).
14. [So87] R. I. Soare, Recursively Enumerable Sets and Degrees: The Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic, fi-Series, Springer-Verlag, Berlin, 1987. MR 88m:03003
15. [Ya66] C. E. M. Yates, A minimal pair of recursively enumerable degrees, J. Symbolic Logic 31 (1966), 159-168. MR 34:5677