Dichotomy on intervals of strong partial Boolean clones
详细信息    查看全文
  • 作者:Karsten Sch?lzel
  • 关键词:Primary ; 08A55 ; Secondary ; 03B50 ; partial clones ; Boolean clones ; intervals
  • 刊名:Algebra Universalis
  • 出版年:2015
  • 出版时间:June 2015
  • 年:2015
  • 卷:73
  • 期:3-4
  • 页码:347-368
  • 全文大小:762 KB
  • 参考文献:1. 6, 58-9 (1994). English translation: Alekseev, V.B., Voronenko, L.L.: On some closed classes in partial two-valued logic. Discrete Math. Appl. 4, 401-19 (1994)
    2. 16 (1970)
    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. IEEE 43rd International Symposium on Multiple-Valued Logic (ISMVL), pp. 123-28 (2013)
    4.Creignou, N., Kolaitis, P., Zanuttini, B.: Structure identification of boolean relations and plain bases for co-clones. J. Comput. Syst. Sci. 74, 1103-115 (2008)
    5.Fugere, J., Haddad, L.: On partial clones containing all idempotent partial operations. 28th IEEE International Symposium on Multiple-Valued Logic, pp. 369-73 (1998)
    6.Haddad, L., Lau, D.: Uncountable families of partial clones containing maximal clones. Beitr. Algebra Geom. 48, 257-80 (2007)
    7.Haddad L., Lau D., Rosenberg I.G.: Intervals of partial clones containing maximal clones. J. Autom. Lang. Comb. 11, 399-21 (2006)MATH MathSciNet
    8.Haddad, L., Simons, G.E.: On intervals of partial clones of Boolean partial functions. 33rd IEEE International Symposium on Multiple-Valued Logic, pp. 315-20 (2003)
    9.Harnau W.: Ein verallgemeinerter Relationenbegriff für die Algebra der mehrwertigen Logik, Teil I (Grundlagen). Rostock. Math. Kolloq. 28, 5-7 (1985)MATH MathSciNet
    10.Harnau, W.: Ein verallgemeinerter Relationenbegriff für die Algebra der mehrwertigen Logik, Teil II (Relationenpaare). Rostock. Math. Kolloq. 31, 11-0 (1987)
    11.Harnau, W.: Ein verallgemeinerter Relationenbegriff für die Algebra der mehrwertigen Logik, Teil III (Beweis). Rostock. Math. Kolloq. 32, 15-4 (1987)
    12.Lau, D.: Function Algebras on Finite Sets. A Basic Course on Many-valued Logic and Clone Theory. Springer Monographs in Mathematics. Springer, Berlin (2006)
    13.Lau, D., Sch?lzel, K.: A Classification of Partial Boolean Clones. 40th IEEE International Symposium on Multiple-Valued Logic, pp. 189-94 (2010)
    14. 2, 1-1 (1981). English translation: Romov, B.A.: The algebras of partial functions and their invariants. Cybernetics, 17, 157-67 (1981)
    15.Strauch, B.: Die Menge \({\mathcal{M}(M \cap T_{0} \cap T_{1})}\) . Universit?t Rostock (1995, preprint)
    16.Strauch, B.: Die Menge \({\mathcal{M}(S \cap T_{0} \cap T_{1})}\) . Universit?t Rostock (1996, preprint)
    17.Strauch, B.: Noncountable many classes containing a fixed class of total Boolean functions. In: Denecke, K. (ed.) Proceedings of the conference on general algebra and discrete mathematics, Potsdam, June 1996. Berichte aus der Mathematik, pp. 177-88. Shaker, Aachen (1997)
    18.Strauch, B.: On partial classes containing all monotone and zero-preserving total Boolean functions. Math. Log. Q. 43, 510-24 (1997)
  • 作者单位:Karsten Sch?lzel (1)

    1. University of Luxembourg, Mathematics Research Unit, 6, rue Richard Coudenhove-Kalergi, L-1359, Luxembourg, Grand Duchy of Luxembourg
  • 刊物类别:Mathematics and Statistics
  • 刊物主题:Mathematics
    Algebra
  • 出版者:Birkh盲user Basel
  • ISSN:1420-8911
文摘
The following result has been shown recently in the form of a dichotomy: For every total clone C on := {0, 1}, the set \({\mathcal{I}}\)(C) of all partial clones on whose total component is C is either finite or of continuum cardinality. In this paper, we show that the dichotomy holds, even if only strong partial clones are considered, i.e., partial clones which are closed under taking subfunctions: For every total clone C on , the set \({\mathcal{I}_{\rm Str}}\)(C) of all strong partial clones on whose total component is C, is either finite or of continuum cardinality.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700