From Surf Wiki (app.surf) — the open knowledge base
Product term
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,
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Product term — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report