Conjunction Formula

A conjunction P Q is a compound statement that is true if and only if both constituent statements P and Q are individually true.

The Formula

P∧QP \wedge Q is true ⇔\Leftrightarrow PP is true and QQ is true

When to use: To enter a theme park ride, you must be tall enough AND have a valid ticket—both conditions must hold. If you are tall enough but lost your ticket, you cannot ride. A conjunction P∧QP \wedge Q works the same way: it is true only when every single part is true, and false the moment any part fails.

Quick Example

"It is raining AND cold" is true only when both weather conditions actually hold at the same time.

Notation

P∧QP \wedge Q

What This Formula Means

A conjunction P∧QP \wedge Q is a compound statement that is true if and only if both constituent statements PP and QQ are individually true.

To enter a theme park ride, you must be tall enough AND have a valid ticket—both conditions must hold. If you are tall enough but lost your ticket, you cannot ride. A conjunction P∧QP \wedge Q works the same way: it is true only when every single part is true, and false the moment any part fails.

Formal View

P∧Q⇔¬(P→¬Q)P \wedge Q \Leftrightarrow \neg(P \to \neg Q); truth table: P∧Q=⊤P \wedge Q = \top iff P=⊤P = \top and Q=⊤Q = \top

Worked Examples

Example 1

easy
Let pp: '44 is even' and qq: '4<104 < 10'. Evaluate p∧qp \land q, p∧¬qp \land \neg q, and ¬p∧q\neg p \land q.

Answer

p∧q=T,p∧¬q=F,¬p∧q=Fp \land q = T,\quad p \land \neg q = F,\quad \neg p \land q = F

First step

1
pp is true (4 is even). qq is true (4 < 10). So ¬q\neg q is false and ¬p\neg p is false.

Full solution

  1. 2
    p∧q=T∧T=Tp \land q = T \land T = T.
  2. 3
    p∧¬q=T∧F=Fp \land \neg q = T \land F = F.
  3. 4
    ¬p∧q=F∧T=F\neg p \land q = F \land T = F.
A conjunction p∧qp \land q is true only when both components are true. If either component is false, the conjunction is false.

Example 2

medium
Construct the full truth table for p∧qp \land q and use it to show that conjunction is commutative: p∧q≡q∧pp \land q \equiv q \land p.

Example 3

medium
Use De Morgan's law to write ¬(P∧Q)\neg(P \wedge Q) in terms of ¬P\neg P and ¬Q\neg Q.

Common Mistakes

  • Declaring P∧QP \wedge Q true when only one part is true — both parts must be true.
  • Swapping ∧\wedge (and, all required) with ∨\vee (or, one suffices) — conjunction is the strict one.
  • Reading 'and' in everyday loose ways — in logic, even one false part makes the conjunction false.

Why This Formula Matters

Conjunction is the strictest connective and models compound requirements (eligibility, constraints, system of conditions). A student who confuses it with 'or' will accept cases where only one condition holds, mis-evaluating compound criteria and truth tables. Recognizing it by "Does the whole claim require every part to be true at the same time?" — rather than by familiar numbers — is what lets a student tell it apart from disjunction (or) and intersection (sets) and conditional (if-then) in a mixed problem set.

Frequently Asked Questions

What is the Conjunction formula?

A conjunction P∧QP \wedge Q is a compound statement that is true if and only if both constituent statements PP and QQ are individually true.

How do you use the Conjunction formula?

To enter a theme park ride, you must be tall enough AND have a valid ticket—both conditions must hold. If you are tall enough but lost your ticket, you cannot ride. A conjunction P∧QP \wedge Q works the same way: it is true only when every single part is true, and false the moment any part fails.

What do the symbols mean in the Conjunction formula?

P∧QP \wedge Q

Why is the Conjunction formula important in Math?

Conjunction is the strictest connective and models compound requirements (eligibility, constraints, system of conditions). A student who confuses it with 'or' will accept cases where only one condition holds, mis-evaluating compound criteria and truth tables. Recognizing it by "Does the whole claim require every part to be true at the same time?" — rather than by familiar numbers — is what lets a student tell it apart from disjunction (or) and intersection (sets) and conditional (if-then) in a mixed problem set.

What do students get wrong about Conjunction?

The procedure for conjunction is the easy part; the trap is declaring P∧QP \wedge Q true when only one part is true. Asking "Does the whole claim require every part to be true at the same time?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

What should I learn before the Conjunction formula?

Before studying the Conjunction formula, you should understand: logical statement.

← Back to Conjunction See All Examples Practice Problems