Boolean sets and most general solutions of Boolean equations
type: Item
instance of: scholarly article
title: Boolean sets and most general solutions of Boolean equations
zbMATH Open document ID: 1209.06006
author: Sergiu Rudeanu
published in: Information Sciences
publication date: 2010-07-20T00:00:00Z
review text: \textit{C. Reischer, D. A. Simovici, I. Stojmenovic} and \textit{R. Tosic} [Inf. Sci. 99, No.~3--4, 195--204 (1997; Zbl 0921.06012)] were the first to determine the internal structure of the set \({\mathcal C}_{f}\) of zeros of a Boolean function \(f\) in terms of ring sum, complementation and the difference \(x-y=xy'\). This paper gives a new construction of \({\mathcal C}_{f}\) and describes the union of the sets \({\mathcal C}_{f}\), called Boolean sets, when \(f\) runs over the set of evanescible Boolean functions of \(n\) variables (\(f\) is said to be evanescible if the Boolean equation \(f(X)=0\) is consistent, i.e., it has solutions \(X\in B^{n}\), where \(B\) is an arbitrary Boolean algebra). On this occasion the paper provides an intrinsic characterization of the most general subsumptive general solution and determines the systems of recurrent inequalities that are subsumptive general solutions of certain Boolean equations and the Boolean transformations that are parametric general solutions of certain Boolean equations. It is also shown that every Boolean transformation \(\Phi :B^{n}\rightarrow B^{n}\) is the parametric general solution of a certain Boolean equation. Four examples are considered.
reviewed by: Ioan Tomescu
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5758540
zbMATH Keywords: Boolean equation
zbMATH Keywords: subsumptive general solution
zbMATH Keywords: parametric general solution
zbMATH Keywords: Boolean set
zbMATH Keywords: Boolean transformation
MaRDI profile type: Publication
full work available at URL: j.ins.2010.01.029
OpenAlex ID: W2080433733
cites work: Solution of systems of Boolean equations via the integer domain
cites work: Q3470465
cites work: Q4022776
cites work: Formulas of general reproductive solutions of Boolean equations
cites work: Q4541845
cites work: Q4542627
cites work: Q5439786
cites work: Boolean inequations
cites work: Q5389285
cites work: Parametric solutions of Boolean equations
cites work: Q5389275
cites work: A characterization of Boolean collections of set-valued functions
cites work: Q4083731
cites work: Q4090324
cites work: Q4156770
cites work: Q3903047
cites work: Q2734536
cites work: Boolean transformations with unique fixed points
DOI: 10.1016/J.INS.2010.01.029
Recommended article: Q3216645
Recommended article: Boolean equations with many unknowns
Recommended article: Q4414841
Recommended article: Q4323377
Recommended article: Q4731231
Recommended article: Q3786513
Recommended article: Boolean equations in algebra of logic and set theory
Recommended article: Q3115713
Recommended article: Formulas of general reproductive solutions of Boolean equations
Recommended article: Implicit Boolean equations.
description: scientific article; zbMATH DE number 5758540