A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.31, Iss.1, 2003-09, pp. : 1-9

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Restriction, terms and nonlinearity of Boolean functions

By Zheng Y. Zhang X.-M. Imai H.

Theoretical Computer Science, Vol. 226, Iss. 1, 1999-09 ,pp. : 207-223

Elsevier

Access to resources Recommend Favorite

Deciding Boolean Algebra with Presburger Arithmetic

By Kuncak Viktor Nguyen Huu Rinard Martin

Journal of Automated Reasoning, Vol. 36, Iss. 3, 2006-04 ,pp. : 213-239

Springer Publishing Company

Access to resources Recommend Favorite

EXORcist Boolean algebra and interactions between binary strings

By Musès C

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 24, Iss. 4, 1995-04 ,pp. : 33-43

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Boolean Algebra from the Lattice Point of View

By Lee Edward T

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 23, Iss. 3, 1994-03 ,pp. : 59-64

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

To the problem of expressibility in the algebra of partial Boolean functions

By Tarasov V.

Problems of Information Transmission, Vol. 41, Iss. 1, 2005-01 ,pp. : 59-64

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite