A characterization of Boolean collections of set-valued functions

https://doi.org/10.1016/S0020-0255(96)00213-7Get rights and content

Abstract

We consider functions on subsets of a finite element set r = {0,…, r-1}. A small fraction of these functions are Boolean functions, i.e., functions that can be constructed from constants and variables, using union, intersection, and complementation. We introduce the notion of Boolean collection of sets, and explore several combinatorial aspects of these collections. A collection C is a set consisting of several n-tuples of subsets of r. We solve the following problem. Given n ⩾ 1, characterize collections C for which there exists a Boolean function F:P(r)nP(r) such that F(X1,…,Xn) = ⊘ if and only if (X1,…,Xn) ε C, where X1,...,XnP(r) and P(r) is the set of subsets of r.

References (8)

  • T. Aoki et al.

    Design of a highly parallel set logic network based on a bio-device model

  • T. Aoki et al.

    Design of interconnection-free biomolecular computing system

  • M. Conrad

    The lure of molecular computing

    IEEE Spectrum

    (1986)
  • M. Kameyama and T. Higuchi, Prospects of multiple-valued bio-information processing systems, in: Proc. 18th Symp....
There are more references available in the full text version of this article.

Cited by (4)

  • Prominent classes of the most general subsumptive solutions of Boolean equations

    2014, Information Sciences
    Citation Excerpt :

    Boolean transformations (functions from Bn to Bm expressed by m Boolean functions from Bn to B) [36–38,43]. A Boolean set (a subset of Bn characterized by a Boolean equation, viz., the set of particular solutions for such an equation) [32]. A main contribution of [44] is that it fills a gap in the process of characterization of subsumptive general solutions of a Boolean equation, which was earlier achieved via another concept called ‘recurrent cover’ [9].

  • Subsumptive general solutions and parametric general solutions of Post equations

    2012, Information Sciences
    Citation Excerpt :

    Post equations were studied by Epstein [8], Carvallo [7], Bordat [5], Beazer [4], Serfati [14–16], Banković [1–3], Rudeanu [11] and other authors. Many theorems from this field represent generalizations of the corresponding result for Boolean functions and equations ([6], [9], [10] and [12]). Rudeanu [13] determined the most general form of the subsumptive general solution of a Boolean equation.

  • Boolean completeness in multiple-valued set logic

    2003, Journal of Multiple-Valued Logic and Soft Computing
View full text