T. H. Mott

Publications31
h-index6
Citations134
Highly Influential Citations9
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • C. Hovland
  • 58 Publications, 8,804 Citations
  • W. Quine
  • 212 Publications, 27,632 Citations
  • R. Nelson
  • 78 Publications, 285 Citations
  • Midhat J. Ghazala
  • 1 Publication, 61 Citations
  • Publications
  • Influence
A Note on Tributary Switching Networks
TLDR
We read Miyata's recent paper' with inand 2) requires no greater appeal to in"commonly." We recognize that the first 3Received November 5, 1963. Expand
  • 21
  • 3
Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants
  • T. H. Mott
  • Mathematics, Computer Science
  • IRE Trans. Electron. Comput.
  • 1 June 1960
TLDR
This paper describes a new algebraic way of determining irredundant forms from the prime implicants. Expand
  • 41
  • 2
Computing Irredundant Normal Forms from Abbreviated Presence Functions
TLDR
A new method is presented for computing irredundant normal forms which renders feasible the handling of ``large'' functions. Expand
  • 14
  • 1
Introduction to Fortran IV programming
  • 9
  • 1
TOWARD SEMI-AUTOMATED MATHEMATICS: THE LANGUAGE AND LOGIC OF SAM III.
TLDR
This report describes the third in a series of computer experiments designed to explore the extent to which computers may feasibly be used in doing formal mathematics. Expand
  • 3
  • 1
INTRODUCTION TO SEMI-AUTOMATED MATHEMATICS.
Abstract : The subject of this report is mechanical theorem proving, and in it are described two computer programs that represent an approach different from the usual ones based on the Herbrand… Expand
  • 2
  • 1
Academic library acquisitions allocation based on multiple collection development goals
TLDR
Lexographic linear goal programming appears to provide an appropriate allocation methodology for allocating library acquisitions funds. Expand
  • 30
An algorithm for determining minimal normal forms of an incomplete truth function
  • T. H. Mott
  • Mathematics
  • Transactions of the American Institute of…
  • 1 March 1961
In certain applications of truth-function logic it is of interest to consider the minimization problem in a more general form.1 So-called “algebraic” procedures for determining the irredundant forms… Expand
  • 6
Introduction to PL-1 programming for library and information science
  • 2
SEMI-AUTOMATED MATHEMATICS: SAM IV.
TLDR
The fourth in a series of computer experiments on theorem proving is described. Expand
  • 2