• DocumentCode
    2090486
  • Title

    On the intersection of maximal partial clones and the join of minimal partial clones

  • Author

    Haddad, L. ; Machida, H. ; Rosenberg, I.G.

  • Author_Institution
    Math. et Inf., Coll. Mil. R. du Canada, Kingston, Ont., Canada
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    396
  • Lastpage
    401
  • Abstract
    Let A be a nonsingleton finite set and M be a family of maximal partial clones with trivial intersection over A. What is the smallest possible cardinality of M? Dually, if F is a family of minimal partial clones whose join is the set of all partial functions on A, then what is the smallest possible cardinality of F? The purpose of this note is to present results related to these two problems
  • Keywords
    multivalued logic; cardinality; maximal partial clones; minimal partial clones; nonsingleton finite set; Algebra; Cloning; Lattices; Mathematics; Time of arrival estimation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on
  • Conference_Location
    Portland, OR
  • ISSN
    0195-623X
  • Print_ISBN
    0-7695-0692-5
  • Type

    conf

  • DOI
    10.1109/ISMVL.2000.848649
  • Filename
    848649