go-v.orgcodex
Menu
Page tools

codex · Philosophy

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∧B A∧(¬B)∧(¬C) ¬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 x1,…,xn, 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, ISBN 0-471-39882-9

Wikipedia contributors, "Product term", Wikipedia, revision 1345539211, retrieved 21 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex