-
174Lattice embeddings into the recursively enumerable degrees. IIJournal of Symbolic Logic 54 (3): 735-760. 1989.
-
187Lattice embeddings into the recursively enumerable degreesJournal of Symbolic Logic 51 (2): 257-272. 1986.
-
64Upper bounds for the arithmetical degreesAnnals of Pure and Applied Logic 29 (3): 225-254. 1985.
-
68A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degreesAnnals of Pure and Applied Logic 94 (1-3): 143-180. 1998.We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degrees
-
72A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degreesAnnals of Pure and Applied Logic 101 (2-3): 275-297. 2000.We present a necessary and sufficient condition for the embeddability of a principally decomposable finite lattice into the computably enumerable degrees. This improves a previous result which required that, in addition, the lattice be ranked. The same condition is also necessary and sufficient for a finite lattice to be embeddable below every non-zero computably enumerable degree
-
110
-
161Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterionJournal of Symbolic Logic 54 (4): 1288-1323. 1989.
