Abstract
D. Lau raised the problem of determining the cardinality of the set of all partial clones of Boolean functions whose total part is a given Boolean clone. The key step in the solution of this problem, which was obtained recently by the authors, was to show that the sublattice of strong partial clones on \(\{0, 1\}\) that contain all total functions preserving the relation \({\rho_{0,2} = \{(0, 0), (0, 1), (1, 0)\}}\) is of continuum cardinality. In this paper, we represent relations derived from \({\rho_{0,2}}\) in terms of graphs, and we define a suitable closure operator on graphs such that the lattice of closed sets of graphs is isomorphic to the dual of this uncountable sublattice of strong partial clones. With the help of this duality, we provide a rough description of the structure of this lattice, and we also obtain a new proof for its uncountability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alekseev V.B., Voronenko L.L.: On some closed classes in partial two-valued logic. Discrete Math. Appl. 4, 401–419 (1994)
Couceiro M., Haddad L.: Intersections of finitely generated maximal partial clones. J. Mult.-Valued Logic Soft Comput. 19, 85–94 (2012)
Couceiro M., Haddad L., Rosenberg I.G.: Partial clones containing all Boolean monotone self-dual partial functions. J. Mult.-Valued Logic Soft Comput. 27, 183–192 (2016)
Couceiro, M., Haddad, L., Schölzel, K., Waldhauser, T.: Relation graphs and partial clones on a 2-element set. In: Proceedings of the 44th IEEE International Symposium on Multiple-Valued Logic (Bremen, 2014). pp. 161–166 (2014)
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, 47–58 (2017)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)
Erdős P.: Graph theory and probability. Canad. J. Math. 11, 34–38 (1959)
Freivald, R.V.: Completeness criteria for functions of the algebra of logic and many-valued logics. Dokl. Akad. Nauk. SSSR 167, 1249–1250 (1966) (Russian)
Grätzer, G., General Lattice Theory, 2nd edn. Birkhäuser, Berlin (2003)
Haddad L.: On the depth of the intersection of two maximal partial clones. Mult.-Valued Log. 3, 259–270 (1998)
Haddad L.: Infinite chains of partial clones containing all selfdual monotonic partial functions. J. Mult.-Valued Logic Soft Comput. 18, 139–152 (2012)
Haddad, L., Lau, D.: Pairwise intersections of Słupecki type maximal partial clones. In: Contributions to Algebra and Geometry. vol. 41, pp. 537–555 (2000)
Haddad L., Simons G.E.: Intervals of Boolean partial clones. Ital. J. Pure Appl. Math. 21, 147–162 (2007)
Harary, F., Read, R.C.: Is the null-graph a pointless concept? In: Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973). Lecture Notes in Math., vol. 406, pp. 37–44. Springer, Berlin (1974)
Lagerkvist V.: Weak bases of boolean co-clones. Inform. Process. Lett. 114, 462–468 (2014)
Lau D.: Über partielle Funktionenalgebren. Rostock. Math. Kolloq. 33, 23–48 (1988) (German)
Lau, D.: Function Algebras on Finite Sets. A basic course on many-valued logic and clone theory. Springer Monographs in Mathematics, Springer, Berlin (2006)
Lau, D., Schölzel, K.: A classification of partial Boolean clones. In: Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic (Barcelona, 2010). pp. 198–194 (2010)
Lehtonen, E., Schölzel, K.: Intervals of the homomorphism order of graphs have infinite width. (2014, preprint)
Romov B.A.: Maximal subalgebras of algebras of partial multivalued logic functions. Cybernetics 16, 31–41 (1980)
Romov B.A.: The algebras of partial functions and their invariants. Cybernetics 17, 157–167 (1981)
Stahl S.: n-tuple colorings and associated graphs. J. Combinatorial Theory Ser. B 20, 185–203 (1976)
Strauch B.: On partial classes containing all monotone and zero-preserving total Boolean functions. Math. Logic Quart. 43, 510–524 (1997)
Strauch, B.: The classes which contain all monotone and idempotent total Boolean functions. Universität Rostock (1996, preprint)
Welzl E.: Color-families are dense. Theoret. Comput. Sci. 17, 29–41 (1982)
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by R. Poeschel.
L. Haddad is supported by Academic Research Program of RMC. K. Schölzel is supported by the internal research project MRDO2 of the University of Luxembourg. T. Waldhauser is supported by the Hungarian National Foundation for Scientific Research under grant no. K104251 and by the János Bolyai Research Scholarship.
Rights and permissions
About this article
Cite this article
Couceiro, M., Haddad, L., Schölzel, K. et al. On the interval of strong partial clones of Boolean functions containing Pol({(0, 0), (0, 1), (1, 0)}). Algebra Univers. 77, 101–123 (2017). https://doi.org/10.1007/s00012-016-0418-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00012-016-0418-8