Skip to main content
Log in

Maximal clones in monoidal intervals. I

  • 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

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

Instant access to the full article PDF.

References

  1. A. V. Kuznetsov, “The word problem and functional completeness of algebraic systems,” in: Proceedings of the 3 All-Union Mathematical Congress, [in Russian], Akad. Nauk SSSR, Moscow, 1956, pp. 145–146.

    Google Scholar 

  2. Á. Szendrei, Clones in Universal Algebra. Séminaire de Mathématique Supérieures (Seminar on Higher Mathematics;99), Les Presses de l'Université de Montreal, Montreal (1986).

    MATH  Google Scholar 

  3. E. L. Post, The Two- Valued Iterative Systems of Mathematical Logic, Princeton Univ. Press, Princeton (1941), (Ann. of Math. Stud.,5)

    MATH  Google Scholar 

  4. A. A. Krokhin, “Monoidal intervals in clone lattices,” Algebra i Logika,34, No. 3, 288–310 (1995).

    Google Scholar 

  5. A. A. Bulatov, A. A. Krokhin, K. L. Safin, and E. V. Sukhanov, “On the structure of clone lattices,” in: General Algebra and Discrete Mathematics, Heldermann Verlag, Berlin, 1995, pp. 27–34.

    Google Scholar 

  6. A. A. Krokhin, “On clones, transformation monoids, and associative rings,” Algebra Universalis,37, No. 4, 527–540 (1997).

    Article  MATH  Google Scholar 

  7. A. A. Krokhin, “Boolean lattices as intervals in clone lattices,” Multiple-Valued Logic,2, No. 3, 263–271 (1997).

    MATH  Google Scholar 

  8. A. I. Mal'tsev, Iterative Post Algebras [in Russian], Nauka, Novosibirsk, 1976.

    Google Scholar 

  9. G. A. Burle, “Classes ofk-valued logic containing all functions of a certain variable,” Diskretnyî Analiz, No. 10, 3–7 (1967).

    MATH  Google Scholar 

  10. S. V. Yablonskiî, “Functional constructions ink-valued logic,” Trudy Mat. Inst. Steklov. Akad. Nauk SSSR,51, 5–142 (1958).

    Google Scholar 

  11. I. G. Rosenberg, “Über die funktionale Vollständigkeit in den mehrwerigen Logiken,” Pozpr. CSAV Rada Math. Prir. Ved. Praha,80, No. 4, 3–93 (1970).

    Google Scholar 

  12. J. Demetrovics and L. Hannák, “The number of reducts of a preprimal algebra,” Algebra Universalis,16, 178–185 (1983).

    Article  MATH  Google Scholar 

  13. A. A. Salomaa, “On infinitely generated sets of operations in finite algebras,” Ann. Univ. Turku. Ser. AI,74, 1–12 (1964).

    Google Scholar 

  14. D. Lau, “Über die Anzahl von abgeschlossnen Mengen linearer Funktionen dern-wertigen Logik,” Elektron. Information. Kybernet.,14, No. 11, 561–563 (1978).

    Google Scholar 

  15. Á. Szendrei, “Algebras of prime cardinality with cyclic automorphism,” Arch. Math. (Basel), No. 39, 417–427 (1982).

    MATH  Google Scholar 

  16. L. Szabó and Á. Szendrei, “Slupecki-type criteria for quasilinear functions over a finite dimensional vector space,” Elektron. Information. Kybernet. 1981, V. 17, N 11-12. P. 601–611.

    Google Scholar 

  17. E. Yu. Zakharova, V. B. Kudryavtsev, and S. V. Yablonskiî, “On precomplete classes ink-valued logics,” Dokl. Akad. Nauk SSSR,186, 509–512 (1969).

    Google Scholar 

  18. L. Haddad and I. G. Rosenberg, “Finite clones containing all permutations,” Canad. J. Math.,46, No. 5, 951–970 (1994).

    MATH  Google Scholar 

  19. I. Ágoston, J. Demetrovics, and L. Hannák, “On the number of clones containing all constants,” Colloq. Math. Soc. János Bolyai, No. 43, 21–25 (1983). (Lectures in Universal Algebra.)

    Google Scholar 

  20. Á. Szendrei, “Term minimal algebras,” Algebra Universalis,32, No. 4, 439–477 (1994).

    Article  MATH  Google Scholar 

  21. G. Rousseau, “Completeness in finite algebras with a single operation,” Proc. Amer. Math. Soc.,18, 1009–1013 (1967).

    Article  MATH  Google Scholar 

  22. J. Demetrovics and L. Hannák, “Construction of large sets of clones,” Z. Math. Logik Grundlag. Math., No. 33, 127–133 (1987).

    Article  MATH  Google Scholar 

  23. Á. Szendrei, “Short maximal chains in the lattice of clones over a finite set,” Math. Nachr., No. 110, 43–58 (1983).

    Article  MATH  Google Scholar 

Download references

Authors

Additional information

Ekaterinburg. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 40, No. 3, pp. 619–631, May–June, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krokhin, A.A. Maximal clones in monoidal intervals. I. Sib Math J 40, 528–538 (1999). https://doi.org/10.1007/BF02679760

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation