On the interval of strong partial clones of Boolean functions containing Pol({(0, 0), (0, 1), (1, 0)})

详细信息    查看全文

• 作者：Miguel Couceiro ; Lucien Haddad ; Karsten Schölzel ; Tamás Waldhauser
• 关键词：Key words and phrasesclone ; partial clone ; Boolean function ; relational clone ; graph
• 刊名：Algebra universalis
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：77
• 期：1
• 页码：101-123
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Algebra;
• 出版者：Springer International Publishing
• ISSN：1420-8911
• 卷排序：77

文摘

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.