25 found
Order:
  1.  18
    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.
  2.  40
    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.
  3.  15
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  14
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  16
    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.
  6.  31
    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.
  7.  15
    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.
  8.  33
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9. Review: A. Cobham, R. Fridshal, J. H. North, An Application of Linear Programming to the Minimization of Boolean Functions. [REVIEW]Thomas H. Mott - 1965 - Journal of Symbolic Logic 30 (2):247-247.
     
    Export citation  
     
    Bookmark  
  10.  6
    Review: E. J. McCluskey, Minimal Sums for Boolean Functions having many Unspecified Fundamental Products. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):263-264.
  11.  18
    Review: E. J. McCluskey, Introduction to the Theory of Switching Circuits. [REVIEW]Thomas H. Mott - 1968 - Journal of Symbolic Logic 33 (4):631-631.
  12.  24
    Review: Franz E. Hohn, Applied Boolean Algebra. An Elementary Introduction. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):104-106.
  13. Review: I. B. Pyne, E. J. McCluskey, An Essay on Prime Implicant Tables. [REVIEW]Thomas H. Mott - 1964 - Journal of Symbolic Logic 29 (1):52-53.
  14.  22
    Review: J. Eldon Whitesitt, Boolean Algebra and Its Applications. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):103-104.
  15.  16
    Review: J. Paul Roth, Two Logical Minimization Problems; J. Paul Roth, Algebraic Topological Methods for the Synthesis of Switching Systems. II; J. Paul Roth, E. G. Wagner, Algebraic Topological Methods for the Synthesis of Switching Systems. III. Minimization of Nonsingular Boolean Trees. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (4):370-373.
  16.  23
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17.  19
    Review: M. J. Ghazala, IBM Journal of Research and Development: Irredundant Disjunctive and Conjunctive Forms of a Boolean Function; T. Rado, IBM Journal of Research and Development: Comments on the Presence Function of Gazale. [REVIEW]Thomas H. Mott - 1965 - Journal of Symbolic Logic 30 (1):106-109.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  12
    Review: R. Fridshal, The Quine Algorithm. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):103-103.
  19. Review: R. H. Urbano, R. K. Mueller, A Topological Method for the Determination of the Minimal Forms of a Boolean Function. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (4):368-370.
  20.  15
    Review: R. W. House, T. Rado, On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems. [REVIEW]Thomas H. Mott - 1967 - Journal of Symbolic Logic 32 (2):264-265.
  21.  19
    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.
  22.  3
    Review: Warren Semon, Synthesis of Series-Parallel Network Switching Functions. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (2):188-188.
  23.  14
    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.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  33
    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.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  25.  15
    Whitesitt J. Eldon. Boolean algebra and its applications. Addison-Wesley Publishing Company, Reading, Mass., and London, 1961, x + 182 pp. [REVIEW]Thomas H. Mott - 1962 - Journal of Symbolic Logic 27 (1):103-104.