Effectively dense boolean algebras and their applications

Transactions of the American Mathematical Society

Volumn 352, Issue 11, 2000, Pages 4989-5012

  Nies, André ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Ideals; Intervals of ; Subrecursive rcducibilities; True arithmetic

Indexed keywords

EID: 23044523559     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0002-9947-00-02652-0     Document Type: Article

References (20)

1. K. Ambos-Spies, On the Structure of the Polynomial-time Degrees of Recursive Sets, Habilitationschrift, Universität Dortmund, 1984
2. K. Ambos-Spics, "Inhomogeneities in the Polynomial-time Degrees: the Degrees of SuperSparse Sets," Information Processing Letters, 22 (1986), 113-117. MR 88e:68036
3. K. Ambos-Spies and A. Nies "The theory of the polynomial many-one degrees of recursive sets is undccidable," STAGS 92, Lecture Notes in Computer Science 577 (1992) 209-218. MR 94m:03068
4. J. Balcazar, J. Diaz, and J. Gabarro, Structural Complexity, Volumes 1 and 2, Springer Verla (1987,1989). MR 91f:68058; MR 91k:68057
5. D. Cenzer and A. Nies, Initial segments of the lattice of Hj classes, to appear in J. Symboli Logic
6. C.C. Chang and H.J. Keisler, Model Theory, North Holland, 1973. MR 53:12927
7. R. Downey and A. Nies, Undecidability results for low complexity degree structures, to appea in J. Comput. System Sei
8. L. Feiner, Hierarchies of Boolean Algebras, J. Symbolic Logic 35 (1970), 365-374. MR 44:39
9. J.-Y. Girard, Proof theory and logical complexity, Bibliopolis, Naples, 1987. MR 89a:03113
10. L. Harrington and A. Nies, Coding in the lattice of enumerable sets, Adv. in Math. 133 (1998), 133-162. MR 99c:03063
11. W. Hodges, Model Theory, Encyclopedia of Mathematics and its Applications 42, Cambridg University Press, 1993. MR 94e:03002
12. A. Lachlan, On the Lattice of Recursively Enumerable Sets, Trans. Amer. Math. Soc. 130 (1968), 1-37. MR 37:2594 [13] R. Ladner, On the Structure of Polynomial Time Reducibility, J. Assoc. Comput. Mach, 22 (1975) 155-171. MR 57:4623
13. 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. MR 85j:03066
14. D. Martin and M. Pour-El, Axiomatizable theories with few axiomatizable extensions, J Symbolic Logic 35 (1970), 205-209. MR 43:6094
15. F. Montagna and A. Sorbi, Universal recursion theoretic properties of r.e. preordered structures, J. Symbolic Logic 50 (1985), 397-406. MR 87k:03046
16. A. Nerode and J. B. Remmel, A Survey of Lattices of Recursively Enumerable Substructures, Recursion Theory, Proceedings of Symposia in Pure Mathematics 42 (1985), 322-375. MR 87b:03097
17. A. Nies, The last question on recursively enumerable many-one degrees, Algebra i Logika 33, (1994), 550-563; English transi., Algebra and Logic 33 (1994), 307-314. MR 96g:03073
18. A. Nies, "Intervals of the lattice of computably enumerable sets and effective Boolean algebras," Bull. London Math. Soc. 29 (1997), 683-92. MR 98j:03057
19. J. Shinoda and T. Slaman, "On the Theory of PTIME Degrees of Recursive Sets," J. Comput. System Sei. 41 (1990) 321-3GG. MR 92b:03049
20. R. Soare, Recursively Enumerable Sets and Degrees, Springer Verlag, Heidelberg, 1987. MR 88m:03003