C. S. Lorens. Invertible Boolean functions. IEEE transactions on electronic computers, vol. EC–13 , pp. 529–541

Journal of Symbolic Logic 36 (2):347-348 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270320

Links

PhilArchive



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

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

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.
Peter S. Landweber. Decision problems of phrase-structure grammars. IEEE transactions on electronic computers, vol. EC-13 , pp. 354–362. [REVIEW]S. -Y. Kuroda - 1967 - Journal of Symbolic Logic 32 (1):115.
Karl S. Menger. Characterization and cardinality of universal functions. IEEE transactions on electronic computers, vol. EC-14 , pp. 720–721. [REVIEW]Edgar N. Gilbert - 1971 - Journal of Symbolic Logic 36 (3):548-549.
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.
Review: C. S. Lorens, Invertible Boolean Functions. [REVIEW]Harold S. Stone - 1971 - Journal of Symbolic Logic 36 (2):347-348.
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.
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.
H. H. LoomsJr., and R. H. WymanJr., On complete sets of logic primitives. IEEE transactions on electronic computers, vol. EC-14 , pp. 173–174. [REVIEW]H. B. Enderton - 1970 - Journal of Symbolic Logic 35 (1):160.
Meo Angelo R.. On the determination of the ps maximal implicants of a switching function. IEEE transactions on electronic computers, vol. EC-14 , pp. 830–840. [REVIEW]A. K. Choudhury - 1968 - Journal of Symbolic Logic 33 (2):303-303.
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. [REVIEW]J. Kuntzmann - 1970 - Journal of Symbolic Logic 35 (1):160-161.

Analytics

Added to PP
2016-06-30

Downloads
16 (#905,992)

6 months
4 (#1,006,062)

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