Home On closed classes in partial k-valued logic that contain the class of monotone functions
Article
Licensed
Unlicensed Requires Authentication

On closed classes in partial k-valued logic that contain the class of monotone functions

  • Valeriy B. Alekseev EMAIL logo
Published/Copyright: October 20, 2019

Abstract

Let A be a precomplete class (a maximal clone) in k-valued logic and T(A) be the family of all closed classes (under superposition) in partial k-valued logic that contain A. A simple test is put forward capable of finding out from a partial order defining the precomplete class A of monotone functions whether the family T(A) is finite or infinite. This completes the solution of the problem of finiteness of T(A) for all precomplete classes of k-valued logic. The proof depends on new families of closed classes founded by the author of the present paper.


Funding

This research was carried out with the financial support of the Russian Foundation for Basic Research (grant no. 17-01-00782-a).

Originally published in Diskretnaya Matematika (2018) 30, №2, 3–13 (in Russian).


References

[1] Alekseev V. B., Voronenko A. A., “On some closed classes in partial two-valued logic”, Discrete Math. Appl., 4:5 (1994), 401–419.10.1515/dma.1994.4.5.401Search in Google Scholar

[2] Lau, D., Function algebras on finite sets: a basic course on many-valued logic and clone theory, Springer, Berlin, 2006, 668 pp.Search in Google Scholar

[3] Couceiro M., Haddad L., Schölzel K., Waldhauser T., “A solution to a problem of D. Lau: Complete classification of intervals in the lattice of partial Boolean clones”, J. Mult.-Valued Logic Soft Comput., 28 (2017), 47–58.10.1109/ISMVL.2013.7Search in Google Scholar

[4] Couceiro M., Haddad L., Rosenberg I.G., “Partial clones containing all Boolean monotone self-dual partial functions”, J. Mult.-Valued Logic Soft Comput., 27 (2016), 183–192.Search in Google Scholar

[5] Haddad L., “Infinite chains of partial clones containing all selfdual monotonic partial functions”, J. Mult.-Valued Logic Soft Comput., 18 (2012), 139–152.Search in Google Scholar

[6] Haddad L., Lau D., Rosenberg I. G., “Intervals of partial clones containing maximal clones”, J. Autom. Lang. Comb., 11:4 (2006), 399–421.Search in Google Scholar

[7] Haddad L., Lau D., “Uncountable families of partial clones containing maximal clones”, Beiträge zur Algebra und Geometrie, 48:1 (2007), 257–280.Search in Google Scholar

[8] Börner F., Haddad L., “Maximal partial clones with no finite basis”, Algebra Univers., 40:4 (1998), 453–476.10.1007/s000120050095Search in Google Scholar

[9] Dudakova O. S., “On classes of partial monotone functions of six-valued logic”, Problems Theor. Cyber.: XVIII Int. Conf. (Penza, June 19-23, 2017): Materials: Edited by Yu.I. Zhuravleva, MAKS Press, Moscow, 2017, 78–81 (in Russian).Search in Google Scholar

[10] Martynyuk V. V., “Investigation of some classes of functions in multi-valued logics”, Problemy kibernetiki, vyp. 3, Fizmatgiz, Moscow, 1960, 49–61 (in Russian).Search in Google Scholar

Received: 2018-04-17
Published Online: 2019-10-20
Published in Print: 2019-10-25

© 2019 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 7.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma-2019-0025/html?lang=en
Scroll to top button