Michael A. Harrison. The number of transitivity sets of Boolean functions. Journal of the Society for Industrial and Applied Mathematics, t. 11 , p. 806–828. - Michael A. Harrison. The number of equivalence classes of Boolean functions under groups containing negation. IEEE transactions on electronic computers, t. EC-12 , p. 559–561. - Michael A. Harrison. On the number of classes of switching networks. Journal of the Franklin Institute, t. 276 , p. 313–327. - Michael A. Harrison. The number of classes of invertible Boolean functions. Journal of the Association for Computing Machinery, t. 10 , p. 25–28 [Book Review]

Journal of Symbolic Logic 35 (1):160-161 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s0022481200092914

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Number of Transitivity Sets of Boolean FunctionsThe Number of Equivalence Classes of Boolean Functions under Groups Containing negation.On the Number of Classes of Switching Networks.The Number of Classes of Invertible Boolean Functions. [REVIEW]J. Kuntzmann & Michael A. Harrison - 1970 - Journal of Symbolic Logic 35 (1):160.
On the Number of Simple Bases of Boolean Functions.On Superpositions of Functions in P k.Investigation of some Classes of Functions in Multivalued Logics.On some Properties of Essential Functions from P k. [REVIEW]Arto Salomaa, G. A. Sestopal, E. Mendelson, S. V. Ablonskij, V. V. Martynuk & E. U. Zaharov - 1966 - Journal of Symbolic Logic 31 (3):501.
Choudhury A. K. and Basu M. S.. On detection of group invariance or total symmetry of a Boolean function. Indian journal of physics, vol. 36 , pp. 31–42; also Proceedings of the Indian Association for the Cultivation of Science, vol. 45 , pp. 31–42.Sheng C. L.. Detection of totally symmetric Boolean functions. IEEE transactions on electronic computers, vol. EC-14 , pp. 924–926.Choudhury A. K. and Das S. R.. Comment on “Detection of totally symmetric Boolean functions.” IEEE transactions on electronic computers, vol. EC-15 , p. 813.Sheno C. L.. Author's reply. IEEE transactions on electronic computers, vol. EC-15 , p. 813. [REVIEW]M. A. Harrison - 1971 - Journal of Symbolic Logic 36 (4):694-695.
C. S. Lorens. Invertible Boolean functions. IEEE transactions on electronic computers, vol. EC–13 , pp. 529–541.Harold S. Stone - 1971 - Journal of Symbolic Logic 36 (2):347-348.
Tison Pierre. Generalization of consensus theory and application to the minimization of Boolean functions. IEEE transactions on electronic computers, vol. EC-16 , pp. 446–456. [REVIEW]James F. Gimpel - 1968 - Journal of Symbolic Logic 33 (3):468-468.
Kudielka V. and Oliva P.. Complete sets of functions of two and three binary variables. IEEE transactions on electronic computers, vol. EC-15 , pp. 930–931. [REVIEW]William Wernick - 1972 - Journal of Symbolic Logic 37 (2):417-417.
On Partial Classes Containig All Monotone and Zero-Preserving Total Boolean Functions.Birger Strauch - 1997 - Mathematical Logic Quarterly 43 (4):510-524.
Abhyankar Shreeram. Absolute minimal expressions of Boolean functions. IRE transactions on electronic computers, vol. EC-8 , pp. 3–8. [REVIEW]E. J. McCluskey - 1959 - Journal of Symbolic Logic 24 (3):255-255.
P-adically closed fields with nonstandard analytic structure.Ali Bleybel - 2010 - Journal of Symbolic Logic 75 (3):802-816.
On the Number of Symmetry Types of Boolean Functions of n Variables.David Slepian - 1955 - Journal of Symbolic Logic 20 (1):70-70.

Analytics

Added to PP
2016-06-30

Downloads
33 (#500,033)

6 months
5 (#711,233)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references