- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Thomas H. Mott
12 found
Order:
- (1 other version)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.
- (1 other version)Fridshal R.. The Quine algorithm. 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, pp. 211–212. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):103-103.
- Gazalé M. J. Ghazala. Irredundant disjunctive and conjunctive forms of a Boolean function. IBM journal of research and development, vol. 1 , pp. 171–176.Rado T.. Comments on the presence function of Gazalé. IBM journal of research and development, vol. 6 , pp. 268–269. [REVIEW]Thomas H. Mott - 1965 - Journal of Symbolic Logic 30 (1):106-109.
- Hohn Franz E.. Applied Boolean algebra. An elementary introduction. The Macmillan Company, New York 1960, xx + 139 pp. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):104-106.
- House R. W. and Rado T.. On a computer program for obtaining irreducible representations for two-level multiple input-output logical systems. Journal of the Association for Computing Machinery, vol. 10 , pp. 48–77. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):264-265.
- I. B. Pyne and E. J. McCluskeyJr., An essay on prime implicant tables. Journal of the Society for Industrial and Applied Mathematics, vol. 9 , pp. 604–631. [REVIEW]Thomas H. Mott - 1964 - Journal of Symbolic Logic 29 (1):52-53.
- (1 other version)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.
- (1 other version)McCluskey E. J.. Introduction to the theory of switching circuits. McGraw-Hill Book Company, New York, St. Louis, San Francisco, Toronto, London, and Sydney, 1965, xv + 318 pp. [REVIEW]Thomas H. Mott - 1969 - Journal of Symbolic Logic 33 (4):631-631.
- (1 other version)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.
- R. W. House and T. Rado. A generalization of Nelson's algorithm for obtaining prime implicants. The journal of symbolic logic, vol. 30 , pp. 8–12. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):265-265.
- Semon Warren. Synthesis of series-parallel network switching functions. The Bell System technical journal, vol. 37 , pp. 877–898. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (2):188-188.
- (1 other version)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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6dc498764b-nlds7 uwo