Okada S.. Topology applied to switching circuits. Proceedings of the Symposium on Information Networks, sponsored by the Polytechnic Institute of Brooklyn Microwave Research Institute, in cooperation with the Institute of Radio Engineers Professional Group on Circuit Theory, and co-sponsored by the Office of Naval Research, the Office of Scientific Research of the Signal Corps, New York, N.Y., April 12, 13, 14, 1954, New York 1955, pp. 267–290 [Book Review]

Journal of Symbolic Logic 21 (2):210-211 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268788

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

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

Rado Tibor. On a simple source for non-computable functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 75–81. [REVIEW]F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
McCluskey E. J. Jr., and Schorr H.. Essential multiple-output prime implicants. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 437–457. [REVIEW]S. Rudeanu - 1970 - Journal of Symbolic Logic 35 (3):483-483.
Watanabe Shigeru. Periodicity of Post's normal process of tag. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 83–99. [REVIEW]Mary Katherine Yntema - 1968 - Journal of Symbolic Logic 33 (2):298-298.
M. P. Schützenberger. On the definition of a family of automata. Information and control, vol. 4 (1961), pp. 245–270. - M. P. Schützenberger. Finite counting automata.Information and control, vol. 5 (1962), pp. 91–107. - M. P. Schützenberger. Certain elementary families of automata. Proceedings of the Symposium of Mathematical Theory of Automata, New York, N.Y., Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, New York1963, pp. 139–153. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
B. Dunham, R. Fridshal, and G. L. Sward. A non-heuristic program for proving elementary logical theorems. English, with French, German, Russian, and Spanish summaries. Information processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, and Butterworths, London, 1960, pp. 282–285. - B. Dunham, R. Fridshal, and J. H. North. Exploratory mathematics by machine. Recent developments in information and decision processes, edited by Robert E. Machol and Paul Gray, The Macmillan Company, New York1962, pp. 149–160. - B. Dunham and J. H. North. Theorem testing by computer. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N. Y., April 24, 25, 26, 1962, Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 173–177. [REVIEW]Joyce Friedman - 1967 - Journal of Symbolic Logic 32 (2):266-266.
McCluskey E. J. Jr., Minimal sums for Boolean functions having many unspecified fundamental products. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20,1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York 1961, pp. 10–17; also Transactions of the American Institute of Electrical Engineers, vol. 81 part 1 , pp. 387–392. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):263-264.
Meo. Angelo Raffaele On the minimal third order expression of a Boolean function. Proceedings of the Third Annual Symposium on Switching Circuit Theory and Logical Design, Chicago, October 7–12, 1962, American Institute of Electrical Engineers, New York 1962, pp. 5–24. [REVIEW]A. K. Choudhury - 1968 - Journal of Symbolic Logic 32 (4):540-540.
The use of analogy and parable in cybernetics with emphasis upon analogies for learning and creativity.Richmond Gordon Pask - 1963 - Dialectica 17 (2-3):167-203.
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90. [REVIEW]Jiří Bečvář - 1967 - Journal of Symbolic Logic 32 (1):121-122.
Cobham A., Fridshal R., and North J. H.. An application of linear programming to the minimization of Boolean functions. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17-20, 1961, and Papers from the First Annual Symposium, Chicago, Ill., October 9-14, 1960, American Institute of Electrical Engineers, New York 1961, pp. 3–9. [REVIEW]Thomas H. Mott - 1965 - Journal of Symbolic Logic 30 (2):247-247.
Arden Dean N.. Delayed-logic and finite-state machines. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20, 1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York 1961, pp. 133–151. [REVIEW]Robert McNaughton - 1971 - Journal of Symbolic Logic 36 (1):151-151.
Stearns R. E., Hartmanis J., and Lewis P. M. II. Hierarchies of memory limited computations. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, pp. 179–190. [REVIEW]Walter J. Savitch - 1972 - Journal of Symbolic Logic 37 (3):624-625.
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):370-373.
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.
What can we do with the research institute for social complexity sciences in indonesia?Hokky Situngkir - 2006

Analytics

Added to PP
2016-06-30

Downloads
12 (#1,111,684)

6 months
4 (#859,620)

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