The Problem of Simplifying Truth Functions

@article{Quine1952ThePO,
  title={The Problem of Simplifying Truth Functions},
  author={W. Quine},
  journal={American Mathematical Monthly},
  year={1952},
  volume={59},
  pages={521-531}
}
  • W. Quine
  • Published 1952
  • Computer Science
  • American Mathematical Monthly
(1952). The Problem of Simplifying Truth Functions. The American Mathematical Monthly: Vol. 59, No. 8, pp. 521-531. 
824 Citations
review: Frank Markham Brown's Boolean Reasoning: The Logic of Boolean Equations
  • 2
Consequence Finding Algorithms
  • 123
Computational Aids for Determining the Minimal Form of a Truth Function
  • 6
A syntactical proof of the Marriage Lemma
  • T. Coquand
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2003
  • 3
Automated deduction in multiple-valued logics
  • R. Hähnle
  • Mathematics, Computer Science
  • International series of monographs on computer science
  • 1994
  • 181
The Automation of Syllogistic I. Syllogistic Normal Forms
  • 9
Irredundant Disjunctive and Conjunctive Forms of a Boolean Function
  • 61
On the revision of action laws: an algorithmic approach
  • 2
  • Highly Influenced
McColl and Minimization
...
1
2
3
4
5
...