Skip to main content
Log in

Binary central relations and submaximal clones determined by nontrivial equivalence relations

  • Published:
Algebra universalis Aims and scope Submit manuscript

Abstract

Let k ≥ 3, θ a nontrivial equivalence relation on E k = {0, . . . ,k – 1}, and ρ a binary central relation on E k (a reflexive graph with a vertex having E k as its neighborhood). It is known that the clones Pol θ and Pol ρ (of operations on E k preserving θ and ρ, respectively) are maximal clones; i.e., covered by the largest clone in the inclusion-ordered lattice of clones on E k . In this paper, we give the classification of all binary central relations ρ on E k such that the clone Pol θ ∩ Pol ρ is maximal in Pol θ.

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.

Similar content being viewed by others

References

  1. Baker K.A., Pixley A.F.: Polynomial interpolation and the Chinese remainder theorem for algebraic systems. Math. Z. 143, 165–174 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Burris S., Sankappanavar H.P.: A Course in Universal Algebra. Springer, New York (1981)

    Book  MATH  Google Scholar 

  3. Jablonskij, S.V.: Functional constructions in many-valued logics. Tr. Mat. Inst. Steklova 51, 5–142 (1958) (Russian)

    Google Scholar 

  4. Lau D.: Bestimmung der Ordnung maximaler Klassen von Funktionen der k-wertigen Logik. Z. Math. Logik u. Grundl. Math. 24, 79–96 (1978)

    Article  MATH  Google Scholar 

  5. Lau D.: Submaximale Klassen von P 3. J. Inf. Process. Cybern. EIK 18, 227–243 (1982)

    MATH  Google Scholar 

  6. Lau D.: Function Algebras on Finite Sets. Springer, New York (2006)

    MATH  Google Scholar 

  7. Post E.L.: Introduction to a general theory of elementary propositions. Amer. J. Math. 43, 163–185 (1921)

    Article  MathSciNet  MATH  Google Scholar 

  8. Post, E.L.: The two-valued iterative systems of mathematical logic. Ann. Math. Studies, vol. 5. Princeton University Press (1941)

  9. Rosenberg I.G.: La structure des fonctions de plusieurs variables sur un ensemble fini. C. R. Acad. Sci. Paris Ser. A-B 260, 3817–3819 (1965)

    MATH  Google Scholar 

  10. Rosenberg, I.G.: Functional completeness in many-valued logics; the structure of functions of several variables on finite sets. Rozpravy C̆eskoslovenské Akad. Věd Řada Mat. Přírod. Vĕd 80, 3–93 (1970) (German)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Etienne R. A. Temgoua.

Additional information

Presented by A. Szendrei.

This research was done during a ten month stay of the first author at the University of Montreal. The financial assistance of AUF (Agence Universitaire de la Francophonie) is gratefully acknowledged. The first author thanks Professor Ivo G. Rosenberg and the Department of Mathematics and Statistics at University of Montreal for their hospitality during his visit.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Temgoua, E.R.A., Rosenberg, I.G. Binary central relations and submaximal clones determined by nontrivial equivalence relations. Algebra Univers. 67, 299–311 (2012). https://doi.org/10.1007/s00012-012-0183-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00012-012-0183-2

2010 Mathematics Subject Classification

Keywords and phrases

Navigation