• DocumentCode
    1964580
  • Title

    Robbins algebra

  • Author

    Kauffman, Louis H.

  • Author_Institution
    Dept. of Math., Stat. & Comput. Sci., Illinois Univ., Chicago, IL, USA
  • fYear
    1990
  • fDate
    23-25 May 1990
  • Firstpage
    54
  • Lastpage
    60
  • Abstract
    It is shown that the Robbins problem can be fruitfully investigated by using a simplified notation for formal algebras. In this notation a nonstandard model for Robbins algebra in terms of the language itself is conjectured. The results show that any algebra satisfying the Robbins axioms is very close to being Boolean. Finiteness, or an instance of absorption (a+b=a ), or an instance of idempotency (a+a=a) will push A into being Boolean. The construction of the proposed non-Boolean model for Robbins algebra is given. Also detailed are the different notations available for this model
  • Keywords
    algebra; formal logic; Robbins algebra; absorption; formal algebras; idempotency; non-Boolean model; notation; notations; Boolean algebra; Computer science; Equations; History; Mathematics; Statistics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on
  • Conference_Location
    Charlotte, NC
  • Print_ISBN
    0-8186-2046-3
  • Type

    conf

  • DOI
    10.1109/ISMVL.1990.122593
  • Filename
    122593
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1964580