Skip to main content
SpringerLink
Log in

Truth tabular degrees of recursively enumerable sets

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

Abstract

The upper semilattice of truth tabular degrees of recursively enumerable (r.e.) sets is studied. It is shown that there exists an infinite set of pairwise tabularly incomparable truth tabular degrees higher than any tabularly incomplete r.e. truth tabular degree. A similar assertion holds also for r.e. m-degrees. Hence follows that a complete truth tabular degree contains an infinite antichain of r.e. m-degrees.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. C. Jockusch, “Relationships between reducibilities,” Trans. Amer. Math. Soc.,142, 229–247 (1969).

    Google Scholar 

  2. S. Kallibekov, “Index sets of m-degrees,” Sibirsk. Matem. Zh., No. 6, 2292–2300 (1971).

    Google Scholar 

  3. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Moscow (1965).

  4. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

  5. S. D. Denisov, “m-degrees of r.e. sets,” Algebra i Logika,9, 422–427 (1970).

    Google Scholar 

  6. A. Lachlan, “A note on universal sets,” J. Symb. Logic,31, No. 4, 573–574 (1966).

    Google Scholar 

  7. S. Kallibekov, “Index sets of degrees of unsolvability,” Algebra i Logika,10, No. 3 (1971).

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch, Academy of Sciences of the USSR, USSR

    S. Kallibekov

Authors
  1. S. Kallibekov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 14, No. 5, pp. 697–702, November, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kallibekov, S. Truth tabular degrees of recursively enumerable sets. Mathematical Notes of the Academy of Sciences of the USSR 14, 958–961 (1973). https://doi.org/10.1007/BF01462257

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01462257

Keywords

Search

Navigation