Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-26T04:06:49.760Z Has data issue: false hasContentIssue false
  • English
  • Français

Undecidability and initial segments of the (r.e.) tt-degrees

Published online by Cambridge University Press:  12 March 2014

Christine Ann Haught  and
Richard A. Shore
Christine Ann Haught
Affiliation:
Department of Mathematics, The University of Chicago, Chicago, Illinois 60637
Richard A. Shore
Affiliation:
Department of Mathematical Sciences, Loyola University of Chicago, Chicago, Illinois 60626 Department of Mathematics, Cornell University, Ithaca, New York 14853
Get access Rights & Permissions [Opens in a new window]

Extract

A notion of reducibility ≤r between sets is specified by giving a set of procedures for computing one set from another. We say that a set A is r-reducible to a set B, A ≤rB, if one of the procedures applied to B gives A. Associated with any such reducibility notion is the structure of r-degrees, the equivalence classes of sets with respect to this reducibility, with the induced ordering. The most general notion of a computable reducibility is that of Turing, ≤T. Here we say that A ≤TB if there is a Turing machine φe which, when equipped with an oracle for B, computes A: φeB = A. Such Turing degree computations are characterized by the phenomenon that only during the computation itself do we discover which questions about B need to be answered to compute A(x). In contrast, for nearly all other computable reducibilities the set of questions needed is given in advance by a recursive procedure. Perhaps the most common example of such a procedure is many-one reducibility, ≤m: A ≤mB if there is a recursive function f such that x ∈ A ⇔ f(x) ∈ B.

Reducibilities with the property that the output, A(x), is determined by the answers that B gives to a set of questions calculated recursively from x are said to be of tabular type. The most general tabular reducibility is called truth-table reducibility, ≤tt. The procedures [e] associated with this reducibility are specified by a recursive function f (= {e}) which, for each x, gives a set of n questions about the oracle and, for each of the possible 2n sets of answers, gives the corresponding output. As usual this defines A ≤ttB as “there is an e such that [e]B = A”. It is with this notion of reducibility and the associated tt-degrees that we shall be concerned in this paper. Basic information on several such strong reducibilities can be found in Rogers [28]. For more information we recommend the survey articles by Odifreddi [25] and Degtev [2] as well as Odifreddi's book [26].

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 3 , September 1990 , pp. 987 - 1006
Copyright
Copyright © Association for Symbolic Logic 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Burris, S. and Sankappanavar, A. P., Lattice theoretic decision problems in universal algebra, Algebra Universalis, vol. 5 (1975), pp. 163–177.CrossRefGoogle Scholar
[2] Degtev, A., On truth-table-like reducibilities in the theory of algorithms, Uspekhi Matematicheskikh Nauk, vol. 34 (1979), no. 3, pp. 137–168; English translation, Russian Mathematical Surveys, vol. 34 (1979), No. 3, pp. 155–192.Google Scholar
[3] Degtev, A., tt- and m-degrees, Algebra i Logika, vol. 12 (1973), pp. 143–161; English translation, Algebra and Logic, vol. 12 (1973), pp. 78–89.Google Scholar
[4] Ershov, Yu. L.et al., Elementary theories, Uspekhi Matematicheskikh Nauk, vol. 20 (1965), no. 4, pp. 37–108; English translation, Russian Mathematical Surveys, vol. 20 (1965), no. 4, pp. 35–105.Google Scholar
[5] Fejer, P. and Shore, R., Minimal tt- and wtt-degrees, to appear in the proceedings of a conference in Oberwolfach, 03 1989.Google Scholar
[6] Fejer, P., Embeddings and extensions of embeddings in the r.e. tt- and wtt-degrees, Recursion theory week (proceedings, Oberwolfach, 1984), Lecture Notes in Mathematics, vol. 1141, Springer-Verlag, Berlin, 1985, pp. 121–140.CrossRefGoogle Scholar
[7] Harrington, L. and Haught, C. A., Limitations on initial segment embeddings in the r.e. tt-degrees (to appear).Google Scholar
[8] Harrington, L. and Shelah, S., The undecidability of the recursively enumerable degrees, Bulletin (New Series) of the American Mathematical Society, vol. 6 (1982), pp. 79–80.CrossRefGoogle Scholar
[9] Harrington, L. and Slaman, T., Interpreting arithmetic in the Turing degrees of the recursively enumerable sets (to appear).Google Scholar
[10] Haught, C. A., Lattice embeddings in the r.e. tt-degrees, Transactions of the American Mathematical Society, vol. 301 (1987), pp. 515–535.CrossRefGoogle Scholar
[11] Haught, C. A. and Shore, R., Initial segments of the wtt-degrees below 0′, to appear in the proceedings of a conference in Oberwolfach, 03 1989.CrossRefGoogle Scholar
[12] Kleene, S. C. and Post, E. L., The upper-semi-lattice of degrees of recursive unsolvability, Annals of Mathematics, ser. 2, vol. 59 (1954), pp. 379–407.CrossRefGoogle Scholar
[13] Kozbev, G. N., On tt-degrees of r.e. T-degrees, Matematicheskii; Sbornik, vol. 106 (148) (1978), pp. 507–514; English translation, Mathematics of the USSR Sbornik, vol. 35 (1979), pp. 173–180.Google Scholar
[14] Lachlan, A., Distributive initial segments of the degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 14 (1968), pp. 457–472.CrossRefGoogle Scholar
[15] Lachlan, A., Initial segments of one-one degrees, Pacific Journal of Mathematics, vol. 29 (1969), pp. 351–366.CrossRefGoogle Scholar
[16] Lachlan, A., Initial segments of many-one degrees, Canadian Journal of Mathematics, vol. 22 (1970), pp. 75–85.CrossRefGoogle Scholar
[17] Lachlan, A., Recursively enumerable many-one degrees, Algebra i Logika, vol. 11 (1972), pp. 326–358; English translation, Algebra and Logic, vol. 11 (1972), pp. 186–202.Google Scholar
[18] Lavrov, I. A., Effective inseparability of the sets of identically true formulas and finitely refutable formulas for certain elementary theories, Algebra i Logika, vol. 2 (1963), pp. 5–18. (Russian).Google Scholar
[19] Lerman, M., Degrees of unsolvability: local and global theory, Springer-Verlag, Berlin, 1983.CrossRefGoogle Scholar
[20] Lerman, M., Initial segments of the degrees of unsolvability, Annals of Mathematics, ser. 2, vol. 93 (1971), pp. 365–389.CrossRefGoogle Scholar
[21] Lerman, M. and Shore, R., Decidability and invariant classes for degree structures, Transactions of the American Mathematical Society, vol. 310 (1988), pp. 669–691.CrossRefGoogle Scholar
[22] Marchenkov, S. S., The existence of recursively enumerable minimal truth-table degrees, Algebra i Logika, vol. 14 (1975), pp. 429–442; English translation, Algebra and Logic, vol. 14 (1975), pp. 257–261.Google Scholar
[23] Nerode, A. and Shore, R., Second order logic and first order theories of reducibility orderings, The Kleene symposium, North-Holland, Amsterdam, 1980, pp. 181–200.CrossRefGoogle Scholar
[24] Nerode, A., Reducibility orderings: theories, definability and automorphisms, Annals of Mathematical Logic, vol. 18 (1980), pp. 61–89.CrossRefGoogle Scholar
[25] Odifreddi, P., Strong reducibilities, Bulletin (New Series) of the American Mathematical Society, vol. 4 (1981), pp. 37–86.CrossRefGoogle Scholar
[26] Odifreddi, P., Classical recursion theory: the theory of functions and sets of natural numbers, North-Holland, Amsterdam, 1989.Google Scholar
[27] Rabin, M. O., A simple method for undecidability proofs and some applications, Logic, methodology and philosophy of science. II, North-Holland, Amsterdam, 1965, pp. 56–68.Google Scholar
[28] Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[29] Shore, R., On the ∀∃-sentences of α-recursion theory, Generalized recursion theory. II (proceedings, Oslo, 1977), North-Holland, Amsterdam, 1978, pp. 331–354.Google Scholar
[30] Shore, R. and Slaman, T., Working below a low2 recursively enumerable degree (to appear).Google Scholar
[31] Shore, R., Working below a high recursively enumerable degree (to appear).Google Scholar
[32] Simpson, S. G., First-order theory of the degrees of recursive unsolvability, Annals of Mathematics, ser. 2, vol. 105 (1977), pp. 121–139.CrossRefGoogle Scholar
[33] Soare, R., Recursively enumerable sets and degrees: a study of computable functions and computably generated sets, Springer-Verlag, Berlin, 1987.CrossRefGoogle Scholar
[34] Spector, C., On degrees of recursive unsolvability, Annals of Mathematics, ser. 2, vol. 64 (1956), pp. 581–592.CrossRefGoogle Scholar