Skip to main content
SpringerLink
Log in

On cardinality of semilattices of enumerations of nondiscrete families

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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.

References

  1. Yu. L. Ershov The Theory of Enumerations [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  2. S. S. Marchenkov, “On semilattices of computable enumerations”, Dokl. Akad. Nauk SSSR,198, No. 4, 766–768 (1971).

    Google Scholar 

  3. A. B. Khutoretskiî, “On cardinality of the upper semilattice of computable enumerations”, Algebra i Logika,10, No. 5, 561–569 (1971).

    Google Scholar 

  4. A. I. Mal'tsev, “Positive and negative enumerations”, Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).

    Google Scholar 

  5. Yu. L. Ershov, “Enumerations of families of general recursive functions”, Sibirsk. Mat. Zh.,8, No. 5, 1015–1025 (1967).

    Google Scholar 

  6. V. V. V'yugin, On some examples of upper semilattices of computable enumeration”, Algebra i Logika,12, No. 5, 512–529 (1973).

    Google Scholar 

  7. V. L. Selivanov, “On enumeration of families of general recursive functions” Algebra i Logika,15, No. 2, 205–226 (1976).

    Google Scholar 

  8. S. A. Badaev, “On computable enumerations of families of general recursive functions”, Algebra i Logika,16, No. 2, 129–148 (1977).

    Google Scholar 

  9. S. S. Goncharov, Equivalent Constructivization [in Russian], Diss. Doktor. Fiz.-Mat. Nauk, Novosibirsk (1981).

  10. V. L. Selivanov, “Two theorems on computable enumerations”, Algebra i Logika,15, No. 4, 470–484 (1976).

    Google Scholar 

  11. A. H. Lachlan, “On the indexing of classes of recursively enumerable sets”, J. Symbolic Logic,31, No. 1, 10–22 (1966).

    Google Scholar 

  12. S. A. Badaev, “On positive and negative enumerations” Sibirsk. Mat. Zh.,18, No. 3, 483–496 (1977).

    Google Scholar 

  13. S. A. Badaev, “To a problem of S. S. Goncharov”, Sibirsk. Mat. Zh.,32, No. 3, 212–214 (1991).

    Google Scholar 

  14. H. Putnam, “Trial and error predicates and the solution to a problem of Mostowski”, J. Symbolic Logic,30, 49–57 (1965).

    Google Scholar 

Download references

Authors
  1. S. A. Badaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Alma-Ata. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 34, No. 5, pp. 3–10, September–October, 1993.

Translated by N. S. Dairbekov

Rights and permissions

Reprints and permissions

About this article

Cite this article

Badaev, S.A. On cardinality of semilattices of enumerations of nondiscrete families. Sib Math J 34, 795–800 (1993). https://doi.org/10.1007/BF00971395

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation