Geodesic
On decomposition of sub-definite partial Boolean functions
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 9 (2016) no. 1, pp. 119-122.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this article we study Boolean functions with two kinds of indeterminacy. We prove criterion of decomposition of this functions including separating decomposition. As a result we have method that allows to obtain representation of an arbitrary function using superposition of functions that have smaller dimentions.
Keywords: incompletely defined Boolean function, sub-definite partial Boolean function
Mots-clés : decomposition, superposition. 
@article{JSFU_2016_9_1_a12,
     author = {Ivan K. Sharankhaev},
     title = {On decomposition of sub-definite partial {Boolean} functions},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {119--122},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2016_9_1_a12/}
}
TY  - JOUR
AU  - Ivan K. Sharankhaev
TI  - On decomposition of sub-definite partial Boolean functions
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2016
SP  - 119
EP  - 122
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2016_9_1_a12/
LA  - en
ID  - JSFU_2016_9_1_a12
ER  - 
%0 Journal Article
%A Ivan K. Sharankhaev
%T On decomposition of sub-definite partial Boolean functions
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2016
%P 119-122
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2016_9_1_a12/
%G en
%F JSFU_2016_9_1_a12
Ivan K. Sharankhaev. On decomposition of sub-definite partial Boolean functions. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 9 (2016) no. 1, pp. 119-122. http://geodesic.mathdoc.fr/item/JSFU_2016_9_1_a12/

[1] V. V. Tarasov, “Completeness criterion for partial logic functions”, Problemy kibernetiki, 30 (1975), 319–325 (in Russian) | MR | Zbl

[2] R. V. Freivald, “Completeness criterion for partial functions of algebra logic and many-valued logics”, Dokl. Akad. Nauk SSSR, 167 (1966), 1249–1250 (in Russian) | MR

[3] V. I. Panteleev, “Completeness criterion for sub-definite partial Boolean functions”, Vestnik Novosibirskogo Gos. Univ. Ser. Mathematika, mechanika, informatika, 9:3 (2009), 95–114 (in Russian) | Zbl

[4] G. N. Povarov, “On functional separability of Boolean functions”, Dokl. Akad. Nauk SSSR, 94:2 (1954), 801–803 (in Russian) | MR | Zbl

[5] V. L. Semicheva, Methods of finding of repetition-free representations of incompletely defined Boolean functions, Dissertation of candidate in physics and mathematics, Irkutsk, 2008 (in Russian)

[6] S. F. Vinokurov, N. A. Peryazev, Selected questions of theory of Boolean functions, Fizmatlit, M., 2001 (in Russian)