• DocumentCode
    3087786
  • Title

    Fundamental properties of Kleene-Stone logic functions

  • Author

    Takagi, Noboru ; Mukaidono, Masao

  • Author_Institution
    Dept. of Comput. Sci., Meiji Univ., Kawasaki, Japan
  • fYear
    1991
  • fDate
    26-29 May 1991
  • Firstpage
    63
  • Lastpage
    70
  • Abstract
    Kleene-Stone algebras have been proposed as an algebra with the properties of both Kleene algebra and Stone algebra. Therefore, they have connections with ambiguity and modality. A Kleene-Stone logic function is defined as a function F:[0,1]n→[0,1] represented by a logic formula. A logic formula is defined to be the form constructed by applying the logic operations AND, OR, NOT to the variable xl,. . .,xn and the constants 0 and 1. A necessary and sufficient condition for functions to be Kleene-Stone logic functions is shown, and an equation of the number of n-variable Kleene-Stone logic functions is presented
  • Keywords
    fuzzy logic; logic design; many-valued logics; switching functions; Kleene algebra; Kleene-Stone algebras; Kleene-Stone logic functions; Stone algebra; ambiguity; modality; Algebra; Computer science; Equations; Fuzzy logic; Fuzzy sets; Logic functions; Multivalued logic; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 1991., Proceedings of the Twenty-First International Symposium on
  • Conference_Location
    Victoria, BC
  • Print_ISBN
    0-8186-2145-1
  • Type

    conf

  • DOI
    10.1109/ISMVL.1991.130706
  • Filename
    130706