## In this paper we introduce the concept of generaliz Boolean function. Such a function has its arguments and value-s in a Boolean &&a and can be written in a manner similar to the canonical disjunctive form, but instead of the product of sim@le or complkmented variables, the product of values of
On generalized Boolean functions II
✍ Scribed by Nicolae Ţăndăreanu
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 442 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
This cycle of papers is b%ed on the concept of generalized Boolean functions introduced by the author in the fhst article of the series. Every generalized Boolean function f : B" + B can be written in a manner similar to the canonical disjunctive form using some function defined on A x B, where A is a finite subset of B containing 0 and 1. The set of those functions f is denoted by GBF,,[A]. In this paper the following questions ar. presented: (1) What is the relationship between GBF,[A,J and GBF,[A,] when A, c A,. (2) What can be said about GBF,.
📜 SIMILAR VOLUMES
Suppose that G llowing corkditions: e denote &a, x) = g(b, x). (hb) b 4 G&s) = {O,l}cAcB k=2 IAl=& and F,,(g) be the set of all n variables Generalized oolean Functions e For Q oolean algebra I=m=2', we/me ~C(B)l = x3 ("; 2)(k + 2)f(m-2). k=O en nit is su#icienlly large, we have