Prof. Dr. Thorsten Jungmann (last updated 2026-10-03)
Willard Van Orman Quine (1908–2000) was an American logician and philosopher in the analytic tradition. He grew up in Akron, Ohio, received his bachelor’s degree in mathematics from Oberlin College in 1930 and his doctorate in philosophy from Harvard University in 1932 under Alfred North Whitehead. From 1956 to 1978 he held the Edgar Pierce Chair of Philosophy at Harvard. He was a teacher of logic and set theory, and he also wrote several papers on the sort of Boolean algebra that is employed in electrical engineering.
The Quine–McCluskey algorithm (German: Quine-McCluskey-Verfahren), a method for the minimization of logic functions that is also known as the method of prime implicants or the tabulation method, was developed by Quine in 1952 and extended by McCluskey in 1956. The algorithm first finds all prime implicants of the function and then uses them in a prime implicant chart to find the essential prime implicants and the other prime implicants that are necessary to cover the function. It solves the same problem as Karnaugh mapping, but its tabular form makes it more efficient for use in computer algorithms and gives a deterministic way to check that the minimal form has been reached. It is more practical than Karnaugh mapping for more than four variables, but its running time grows exponentially with the number of variables.
In his book ‘Mathematical Logic’ Quine also described the NOR operation and wrote it with the symbol ↓; the operation is also known as the Peirce arrow (see Peirce) or the Quine dagger. The book also made much of the stroke named after Sheffer.
Reference and further reading:
https://en.wikipedia.org/wiki/Willard_Van_Orman_Quine
https://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm
https://en.wikipedia.org/wiki/Logical_NOR
https://en.wikipedia.org/wiki/Henry_M._Sheffer
Image source: Wikimedia Commons (CC BY 4.0, Maryclaire Quine)
