Skip to main content
SpringerLink
Log in

Homomorphisms onto effectively separable algebras

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We study variations of the concept of separable enumeration and, basing on that, describe a series of algorithmic and algebraic concepts. In this framework we characterize negative equivalences, describe enumerated algebras with the most general separability conditions, give a separability criterion for the enumerated algebras satisfying the descending chain condition for the lattices of congruences, and consider some questions related to the algorithmic complexity of enumerations of the algebras satisfying various separability axioms.

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.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Ershov Yu. L. and Goncharov S. S., Constructive Models, Ser. Siberian School of Algebra and Logic, Kluwer Academic/Plenum Publishers, New York, etc. (2000).

    Google Scholar 

  3. Mal’tsev A. I., “To the general theory of algebraic systems,” Mat. Sb., 35, No. 1, 3–20 (1954).

    MathSciNet  MATH  Google Scholar 

  4. Mal’tsev A. I., “Constructive algebras. I,” Russian Math. Surveys, 16, No. 3, 77–129 (1961).

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  6. Kasymov N. Kh., “Recursively separable enumerated algebras,” Russian Math. Surveys, 51, No. 3, 509–538 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  7. Kasymov N. Kh., “Algebras over negative equivalences,” Algebra and Logic, 33, No. 1, 46–48 (1994).

    Article  MathSciNet  MATH  Google Scholar 

  8. Kasymov N. Kh., “On semigroups of recursive automorphisms of enumerable systems,” Dokl. Akad. Nauk Republic Uzbekistan, No. 12, 3–4 (1996).

    MATH  Google Scholar 

  9. Kasymov N. Kh. and Morozov A. S., “On definability of linear orders over negative equivalences,” Algebra and Logic (to be published).

  10. Khoussainov B., Slaman T., and Semukhin P., “π1 0-Presentations of algebras,” Arch. Math. Logic, 45, No. 6, 769–781 (2006).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Uzbekistan National University, Tashkent, Uzbekistan

    N. Kh. Kasymov

Authors
  1. N. Kh. Kasymov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Kh. Kasymov.

Additional information

Tashkent. Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 57, No. 1, pp. 47–66, January–February, 2016; DOI: 10.17377/smzh.2016.57.105.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kasymov, N.K. Homomorphisms onto effectively separable algebras. Sib Math J 57, 36–50 (2016). https://doi.org/10.1134/S0037446616010055

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446616010055

Keywords

Search

Navigation