Intervals of the lattice of computably enumerable sets and effective boolean algebras

Bulletin of the London Mathematical Society

Volumn 29, Issue 6, 1997, Pages 683-692

  Nies, André ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009887780     PISSN: 00246093     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024609397003548     Document Type: Article

References (15)

1. S. BURRIS and H. P. SANKAPPANAVAR, A course in universal algebra (Springer, Heidelberg, 1981).
2. C. C. CHANG and H. J. KEISLER, Model theory (North-Holland, Amsterdam, 1973).
3. P. CHOLAK and A. NIES, 'Atomless r-maximal sets', to appear.
4. R. DOWNEY and A. NIES, 'Undecidability results for low level degree structures', Proc. 12th Annual IEEE Conf. on Computational Complexity (IEEE Computer Science Press, Los Alamitos, CA, 1997) 128-132.
5. S. FEFERMAN and A. VAUGHT, 'The first-order properties of algebraic systems', Fund. Math. 47 (1959) 57-103.
6. J.-Y. GIRARD, Proof theory and logical complexity (Bibliopolis, Naples, 1987).
7. L. HARRINGTON and A. NIES, 'Coding in the lattice of enumerable sets', Adv. Math., to appear.
8. E. HERRMANN, 'The undecidability of the elementary theory of the lattice of recursively enumerable sets (abstract)', Proceedings of the 2nd Frege Conference at Schwerin, GDR (1984), Math. Forschung 20 (ed. G. Wechsung, Akademie, Berlin, 1984) 66-72.
9. W. HODGES, Model theory, Encyclopedia Math. Appl. 42 (Cambridge University Press, 1993).
10. A. LACHLAN, 'On the lattice of recursively enumerable sets', Trans. Amer. Math. Soc. 130 (1968) 1-37.
11. W. MAASS and M. STOB, 'The intervals of the lattice of recursively enumerable sets determined by major subsets', Ann. Pure Appl. Logic 24 (1983) 189-212.
12. A. NERODE and J. B. REMMEL, 'A survey of lattices of recursively enumerable substructures', Recursion theory, Proc. Sympos. Pure Math. 42 (Amer. Math. Soc., Providence, RI, 1985) 322-375.
13. A. NIES, 'Undecidable fragments of elementary theories', Algebra Universalis 35 (1996) 8-33.
14. A. NIES, 'Effectively dense boolean algebras and their applications', to appear.
15. R. SOARE, Recursively enumerable sets and degrees (Springer, Heidelberg, 1987).