Gould Roderick. A note on contact networks for switching functions of four variables. Transactions of the I.R.E. Professional Group on Electronic Computers, vol. EC-7 no. 3 , pp. 196–198 [Book Review]

Journal of Symbolic Logic 24 (3):261-261 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2963868

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Review: Roderick Gould, A Note on Contact Networks for Switching Functions of Four Variables. [REVIEW]Edward F. Moore - 1959 - Journal of Symbolic Logic 24 (3):261-261.
Muller David E.. Complexity in electronic switching circuits. Transactions of the IRE Professional Group on Electronic Computers, vol. EC-5 no. 1 , pp. 15–19. [REVIEW]Edward F. Moore - 1960 - Journal of Symbolic Logic 25 (3):300-300.
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.
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.
Review: Thomas H. Mott, Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants; D. M. Y. Chang, T. H. Mott, Computing Irredundant Normal Forms from Abbreviated Presence Functions. [REVIEW]A. K. Choudhury - 1967 - Journal of Symbolic Logic 32 (4):541-542.
Review: D. E. Muller, Application of Boolean Algebra to Switching Circuit Design and to Error Detection. [REVIEW]Raymond J. Nelson - 1955 - Journal of Symbolic Logic 20 (2):195-195.
Arant Gene W.. A time-sequential tabular analysis of flip-flop logical operation. Transactions of the Institute of Radio Engineers Professional Group on Electronic Computers, vol. EC-6 no. 4 , pp. 72–74. [REVIEW]Calvin C. Elgot - 1959 - Journal of Symbolic Logic 24 (1):74-74.
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.
Hennie Frederick C.. Analysis of bilateral iterative networks. Transactions of the I.R.E. Professional Group on Circuit Theory, vol. CT-6 no. 1 , pp. 35–45. [REVIEW]Edward F. Moore - 1959 - Journal of Symbolic Logic 24 (3):259-260.
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.
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.
Caldwell H. S.. The recognition and identification of symmetric switching functions. Transactions of the American Institute of Electrical Engineers, vol. 73 part I , pp. 142–146.Lee C. Y.. Switching functions on an n-dimensional cube. Transactions of the American Institute of Electrical Engineers, vol. 73 part I , pp. 289–291. [REVIEW]Raymond J. Nelson - 1955 - Journal of Symbolic Logic 20 (2):197-197.
A study on universal functions.Bruno Buchberger - 1972 - Innsbruck, Austria: Institut für Numerische Mathematik und Elektronische Informationsverarbeitung, Universität Innsbruck. Edited by Bernhard Roider.
R. H. Urbano and R. K. Mueller. A topological method for the determination of the minimal forms of a Boolean function. Transactions of the IRE Professional. Group on Electronic Computers, vol. EC-5 no. 3 , pp. 126–132. - David M. Brender. The logical procedures needed for finding the minimals of a Boolean function on a digital computer. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, p. 210. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (4):368-370.
Logic Tutors and Their Applications.Robert Beghie Matthews & John Roger Abrahams - 1968

Analytics

Added to PP
2016-06-30

Downloads
17 (#843,162)

6 months
4 (#818,853)

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