All General Reproductive Solutions of Boolean Equations
Publications de l'Institut Mathématique, _N_S_46 (1989) no. 60, p. 13
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
An equation is called a finite equation if its solution set
is a subset of a given finite set. Applying some kind of algebraic
structure S. Prešić determined in [7] the formulas of all general
reproductive solutions of such equations. Using Prešić's result
we determine in this paper the formulas of all general reproductive
solutions of arbitrary Boolean equations.
Classification :
03G05
Dragić Banković. All General Reproductive Solutions of Boolean Equations. Publications de l'Institut Mathématique, _N_S_46 (1989) no. 60, p. 13 . http://geodesic.mathdoc.fr/item/PIM_1989_N_S_46_60_a2/
@article{PIM_1989_N_S_46_60_a2,
author = {Dragi\'c Bankovi\'c},
title = {All {General} {Reproductive} {Solutions} of {Boolean} {Equations}},
journal = {Publications de l'Institut Math\'ematique},
pages = {13 },
year = {1989},
volume = {_N_S_46},
number = {60},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_1989_N_S_46_60_a2/}
}