gives the conjunction of expr over all choices of the Boolean variables ai.



open allclose all

Basic Examples  (3)

The conjunction over a set of variables:

Show that a formula is a tautology:

Find the conditions on a for ab to be true for any b:

Properties & Relations  (5)

Conjunction effectively computes the And over all truth values of the listed variables:

Conjunction is typically more efficient and can handle large numbers of variables:

Conjunction effectively eliminates (ForAll) quantifiers for the list of variables:

Use Resolve to eliminate more general combinations of quantifiers:

TautologyQ is Conjunction over all variables:

Use Disjunction to compute Or over a list of variables:

Disjunction is related to Conjunction by de Morgan's law:

Conjunction is repeated And, just as Product is repeated Times:

Represent Conjunction in terms of Product:

Wolfram Research (2008), Conjunction, Wolfram Language function,


Wolfram Research (2008), Conjunction, Wolfram Language function,


@misc{reference.wolfram_2020_conjunction, author="Wolfram Research", title="{Conjunction}", year="2008", howpublished="\url{}", note=[Accessed: 26-January-2021 ]}


@online{reference.wolfram_2020_conjunction, organization={Wolfram Research}, title={Conjunction}, year={2008}, url={}, note=[Accessed: 26-January-2021 ]}


Wolfram Language. 2008. "Conjunction." Wolfram Language & System Documentation Center. Wolfram Research.


Wolfram Language. (2008). Conjunction. Wolfram Language & System Documentation Center. Retrieved from