pp 1–14 | Cite as

On Finite Generability of Clones of Finite Posets

  • Ádám KunosEmail author
  • Miklós Maróti
  • László Zádori


In the first part of this paper we present a new family of finite bounded posets whose clones of monotone operations are not finitely generated. The proofs of these results are analogues of those in the famous paper of Tardos. Another interesting family of finite posets from the finite generability point of view is the family of locked crowns. To decide whether the clone of a locked crown where the crown is of at least six elements is finitely generated or not one needs to go beyond the scope of Tardos’s proof. Although our investigations are not conclusive in this direction, they led to the results in the second part of the paper. We call a monotone operation ascending if it is greater than or equal to some projection. We prove that the clones of bounded posets are generated by certain ascending idempotent monotone operations and the 0 and 1 constant operations. A consequence of this result is that if the clone of ascending idempotent operations of a finite bounded poset is finitely generated, then its clone is finitely generated as well. We provide an example of a half bounded finite poset whose clone of ascending idempotent operations is finitely generated but whose clone is not finitely generated. Another interesting consequence of our result is that if the clone of a finite bounded poset is finitely generated, then it has a three element generating set that consists of an ascending idempotent monotone operation and the 0 and 1 constant operations.


Maximal clones Finitely generated clones Bounded posets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



We are thankful to the anonymous referees, especially to one of them whose suggestions made the proof of Theorem 4 simpler and led to an improved version of the definition of the operations \({g^{z}_{y}}\) in the proof of Theorem 12.


  1. 1.
    Rosenberg, I.G.: Über die funktionale Vollständingkeit in dem mehrwertigen Logiken. Rozpravy Ceskoslovenske Akad. Ved., Ser. Math. Nat. Sci. 80, 3–93 (1970)Google Scholar
  2. 2.
    Demetrovics, J., Hannák, L., Rónyai, L.: Near unanimity functions of partial orderings. In: Proc. 14th International Symp. on Multiple Valued Logic, Winnipeg, pp. 52–56 (1984)Google Scholar
  3. 3.
    Demetrovics, J., Rónyai, L.: Algebraic properties of crowns and fences. Order 6/1, 91–99 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    McKenzie, R.: Monotone clones, residual smallness and congruence distributivity. Bull. Austral. Math. Soc. 41, 283–300 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Tardos, G.: A maximal clone of monotone operations which is not finitely generated. Order 3/3, 211–218 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Zádori, L.: Posets, near unanimity functions and zigzags. Bull. Aust. Math. Soc. 47/1, 79–93 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Zádori, L.: Series-parallel posets with non-finitely generated clones. Order 10/4, 305–316 (1993)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature B.V. 2019

Authors and Affiliations

  1. 1.Bolyai InstituteUniversity of SzegedSzegedHungary

Personalised recommendations