The Mathematical Intelligencer

, Volume 12, Issue 1, pp 21–32 | Cite as

A curious new result in switching theory

  • Lee C. F. Sallows


Boolean Function Boolean Algebra Finite State Machine Circuit Diagram Boolean Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Russell,The Autobiography of Bertrand Russell, Unwin (1978), p. 466.Google Scholar
  2. 2.
    C. E. Shannon, A symbolic analysis of relay and switching circuits,Trans. AIEE 57 (1938), 713–723.Google Scholar
  3. 3.
    G. A. Montgomerie, Sketch for an algebra of relay and contractor circuits,Jour. IEE 95, Part III (1948), 303–312.Google Scholar
  4. 4.
    J. E. Savage,The Complexity of Computing, Wiley (1976).Google Scholar
  5. 5.
    L. Wos,A Computer Science Reader, Ed. E. A. Weiss, Springer-Verlag, (1988), pp. 110-137. Orig. pub.Abacus, vol. 2, no. 3 (Spring 1985), pp. 6-21.Google Scholar
  6. 6.
    L. Wos, R. Overbeek, E. Lusk & J. Boyle,Automated Reasoning,Introduction and Applications, Prentice-Hall (1984).Google Scholar
  7. 7.
    M. Minsky,Computation: Finite and Infinite Machines, Prentice-Hall (1967), p. 65.Google Scholar
  8. 8.
    E. N. Gilbert, Lattice theoretic properties of frontal switching functions,Jour. Math. & Physics 33 (April 1954), 57–67.zbMATHGoogle Scholar
  9. 9.
    A. A. Markov, “On the inversion complexity of a system of functions” (translated by M. D. Friedman),JACM 5 (1958), 331–334. Orig. pub.Doklady Akad. Nauk SSSR 116 (1957), 917-919.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 1990

Authors and Affiliations

  • Lee C. F. Sallows
    • 1
  1. 1.NijmegenThe Netherlands

Personalised recommendations