Strong closure operators on the set of partial Boolean functions

被引：0

作者：

S. S. Marchenkov

机构：

[1] Moscow State University,Faculty of Computational Mathematics and Cybernetics

来源：

Doklady Mathematics | 2008年 / 77卷

关键词：

Boolean Function; Composition Operator; DOKLADY Mathematic; Closure Operator; Logical Formula;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：288 / 289

页数：1

共 50 条

[31] POLYNOMIAL FORMS OF PARTIAL BOOLEAN FUNCTIONS AND APPLICATIONS
AVSARKISYAN, GS
ENGINEERING CYBERNETICS, 1983, 21 (04): : 133 - 142
[32] To the problem of expressibility in the algebra of partial Boolean functions
Tarasov V.V.
Problems of Information Transmission, 2005, 41 (01) : 59 - 64
[33] Positively closed classes of partial Boolean functions
Marchenkov S.S.
Popova A.A.
Moscow University Computational Mathematics and Cybernetics, 2008, 32 (3) : 147 - 151
[34] The weak closure of the set of left translation operators
Chou, C
Xu, GW
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1999, 127 (02) : 465 - 471
[35] Complexity of sequential implementation of partial Boolean functions
Sholomov, L. A.
DOKLADY MATHEMATICS, 2007, 75 (03) : 449 - 452
[36] PARALLEL DECOMPOSITION OF A SYSTEM OF PARTIAL BOOLEAN FUNCTIONS
Pottosin, Yu, V
VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2018, (45): : 83 - 91
[37] RECURRENT POLYNOMIAL FORMS OF PARTIAL BOOLEAN FUNCTIONS
AVSARKISYAN, GS
SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1988, 26 (01): : 115 - 119
[38] COMPLEXITY OF ACTIVITY TESTS FOR PARTIAL BOOLEAN FUNCTIONS
VARDANYAN, VA
AUTOMATION AND REMOTE CONTROL, 1986, 47 (07) : 982 - 987
[39] Complexity of sequential implementation of partial Boolean functions
L. A. Sholomov
Doklady Mathematics, 2007, 75 : 449 - 452
[40] The formal strong completeness of partial monoidal Boolean BI
Larchey-Wendling, Dominique
JOURNAL OF LOGIC AND COMPUTATION, 2016, 26 (02) : 605 - 640

← 1 2 3 4 5 →