Skip to main content
SpringerLink
Log in

Tabular powers of maximal sets

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

Abstract

The following result is established for reducibility of tabular type. Whatever the recursively enumerated nonrecursive incomplete power is, there exists a power, not congruent with it, containing a maximal set.

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. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

  2. C. E. M. Yates, “On the degrees of index sets, II,” Trans. Am. Math. Soc.,135, 249–266 (1969).

    Google Scholar 

  3. Yu. L. Ershov and I. A. Lavrov, “The upper semilattice L(γ),” Algebra i Logika,12, No. 2, 167–189 (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Academy of Sciences of the USSR, USSR

    S. S. Marchenkov

Authors
  1. S. S. Marchenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 20, No. 3, pp. 373–381, September, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marchenkov, S.S. Tabular powers of maximal sets. Mathematical Notes of the Academy of Sciences of the USSR 20, 766–770 (1976). https://doi.org/10.1007/BF01097247

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation