Definability of Boolean Function Over Many-value Boolean Algebra

Kang, Andy N.C. and Shen, Stewart N.T. (1974) Definability of Boolean Function Over Many-value Boolean Algebra . Technical Report CS74007-R, Computer Science, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
CS74007-R.pdf (753959)

Abstract

In this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm is also presented for finding the defining boolean expressions for the definable functions over B_2, The result is then extended to the functions over B_s.

Item Type:	Departmental Technical Report
Keywords:	boolean algebra, boolean functions, definability
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	761
Deposited By:	Administrator, Eprints
Deposited On:	17 April 2006