Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

Journal of Symbolic Logic

Volumn 61, Issue 3, 1996, Pages 880-905

  Ambos Spies, Klaus ^a   Fejer, Peter A ^c   Lempp, Steffen ^b   Lerman, Manuel ^d  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

^c UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

^d UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Decidable fragment; Recursive polynomial many one degree; Recursively enumerable weak truth table degree

Indexed keywords

EID: 0030494882     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275790     Document Type: Article

References (26)

1. KLAUS AMBOS-SPIES, Cupping and noncapping in the r.e. weak truth table and Turing degrees, Archiv für Mathematische Logik und Grundlagforschung, vol. 25 (1985), pp. 109-126.
2. _, Sublattices of the polynomial time degrees, Information and Control, vol. 65 (1985), pp. 63-84.
3. _, Polynomial time degrees of NP sets, Trends in theoretical computer science (Rockville, MD) (Egon Börger, editor), Computer Science Press, 1987, pp. 95-142.
4. KLAUS AMBOS-SPIES, STEVEN HOMER, and ROBERT I. SOARE, Minimal pairs and complete problems, Theoretical Computer Science, vol. 132 (1994), pp. 229-241.
5. KLAUS AMBOS-SPIES, CARL G. JOCKUSCH, JR., RICHARD A. SHORE, and ROBERT I. SOARE, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several classes with the promptly simple degrees, Transactions of the American Mathematical Society, vol. 281 (1984), pp. 109-128.
6. KLAUS AMBOS-SPIES, ANDRÉ NIES, and RICHARD A. SHORE, The theory of the recursively enumerable weak truth-table degrees is undecidable, this JOURNAL, vol. 57 (1992), pp. 864-874.
7. JOSE LUIS BALCAZAR, JOSEP DIAZ, and JOAQUIM GABARRO, Structural complexity, volume 1, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1988.
8. GARRETT BIRKHOFF, Lattice theory, Colloquium Publications, American Mathematical Society, New York, 1948.
9. A. N. DEGTEV, Some results on upper semilattices and m-degrees, Algebra i Logika, vol. 18 (1979), pp. 665-679, 754, in Russian; English translation in Algebra and Logic, vol. 18 (1979), pp. 420-430.
10. A. N. DEGTEV, Some results on upper semilattices and m-degrees, Algebra i Logika, vol. 18 (1979), pp. 665-679, 754, in Russian; English translation in Algebra and Logic, vol. 18 (1979), pp. 420-430.
11. Y. L. ERSHOV, The uppersemilattice of numerations of a finite set, Algebra i Logika, vol. 14 (1975), pp. 258-284, 368, in Russian; English translation in Algebra and Logic, vol. 14 (1975), pp. 159-175.
12. Y. L. ERSHOV, The uppersemilattice of numerations of a finite set, Algebra i Logika, vol. 14 (1975), pp. 258-284, 368, in Russian; English translation in Algebra and Logic, vol. 14 (1975), pp. 159-175.
13. PETER A. FEJER, Branching degrees above low degrees, Transactions of the American Mathematical Society, vol. 273 (1982), pp. 157-180.
14. PETER A. FEJER and RICHARD A. SHORE, Embeddings and extensions of embeddings in the r.e. tt and wtt-degrees, Recursion theory week, Proceedings of a conference held in Oberwolfach, West Germany, April 15-21, 1984 (H. D. Ebbinghaus, G. H. Müller, and G. E. Sacks, editors), Lecture Notes in Mathematics, no. 1141, Springer-Verlag, 1985, pp. 121-140.
15. GEORGE GRÄTZER, Lattice theory: First concepts and distributive lattices, A Series of Books in Mathematics, W. H. Freeman, San Francisco, 1971.
16. JOHN E. HOPCROFT and JEFFREY D. ULLMAN, Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, MA, 1979.
17. 2-theory of the upper semilattice of Turing degrees, this JOURNAL, vol. 58 (1993), pp. 193-204.
18. RICHARD E. LADNER and LEONARD P. SASSO, JR., The weak truth table degrees of recursively enumerable sets, Annals of Mathematical Logic, vol. 8 (1975), pp. 429-448.
19. 4-theory for the r.e. wtt- and Turing degrees, to appear, this JOURNAL.
20. MANUEL E. LERMAN, Degrees of unsolvability, Perspectives in Mathematical Logic, Ω-Series, Springer-Verlag, Berlin, 1983.
21. PIERGIORGIO ODIFREDDI, Classical recursion theory, Studies in Logic and the Foundations of Mathematics, vol. 125, North-Holland, Amsterdam, 1989.
22. RICHARD A. SHORE, On the ∀∃-sentences of α-recursion theory, Generalized recursion theory II (Amsterdam) (Jens E. Fenstad, Robin O. Gandy, and Gerald E. Sacks, editors), Studies in Logic and the Foundations of Mathematics, vol. 94, North-Holland, 1978, pp. 331-354.
23. RICHARD A. SHORE and THEODORE A. SLAMAN, The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory, Theoretical Computer Science, vol. 97 (1992), pp. 263-284.
24. ROBERT I. SOARE, Recursively enumerable sets and degrees: The study of computable functions and computably generated sets, Perspectives in Mathematical Logic, Ω-Series, Springer-Verlag, Berlin, 1987.
25. MICHAEL STOB, Wtt-degrees and T-degrees of recursively enumerable sets, this JOURNAL, vol. 48 (1983), pp. 921-930.
26. MARSHALL STONE, The theory of representations for Boolean algebras, Transactions of the American Mathematical Society, vol. 40 (1936), pp. 37-111.