Product term
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In Boolean logic, a product term is a conjunction of literals, where each literal is either a variable or its negation.
In Boolean logic, a product term is a conjunction of literals, where each literal is either a variable or its negation.
Examples
Examples of product terms include: A \wedge B A \wedge (\neg B) \wedge (\neg C) \neg A
Origin
The terminology comes from the similarity of AND to multiplication as in the ring structure of Boolean rings.
Minterms
For a boolean function of n variables {x_1,\dots,x_n} , a product term in which each of the n variables appears once (in either its complemented or uncomplemented form) is called a minterm. Thus, a minterm is a logical expression of n variables that employs only the complement operator and the conjunction operator.
References
Fredrick J. Hill, and Gerald R. Peterson, 1974, Introduction to Switching Theory and Logical Design, Second Edition, John Wiley & Sons, NY,
Text derived from https://en.wikipedia.org/w/index.php?oldid=1345539211 under CC BY-SA 4.0; modifications have been made.