Mathwords logoMathwords

Truth Value — Definition, Formula & Example

Truth value is the label true or false that a statement receives. A sentence like "7 is prime" has truth value true, and "7 is even" has truth value false.

Let SS be a set of propositions. A truth assignment (or valuation) is a function v:S→{T,F}v: S \to \{\text{T}, \text{F}\}, often coded as {1,0}\{1, 0\}. It assigns each atomic proposition exactly one truth value. The truth value of a compound proposition is then fixed by the truth values of its parts and the rules of its connectives. In classical two-valued logic no proposition is both true and false, and none is neither.

Key Formula

v(¬P)=1−v(P),v(P∧Q)=min⁡(v(P),v(Q)),v(P∨Q)=max⁡(v(P),v(Q))v(\neg P) = 1 - v(P), \qquad v(P \wedge Q) = \min\big(v(P), v(Q)\big), \qquad v(P \vee Q) = \max\big(v(P), v(Q)\big)
Where:
  • v(P)v(P) = truth value of statement P: 1 for true, 0 for false
  • ¬P\neg P = negation of P ("not P")
  • P∧QP \wedge Q = conjunction ("P and Q")
  • P∨QP \vee Q = disjunction ("P or Q", inclusive)

Worked Example

Problem: Let P be "2 + 3 = 5" and Q be "4 is odd." Find the truth values of P ∧ Q, P ∨ Q, and P → Q.
Step 1: Find the truth value of each simple statement. Since 2 + 3 really is 5, P is true. Since 4 is even, Q is false.
v(P)=1,v(Q)=0v(P) = 1, \qquad v(Q) = 0
Step 2: A conjunction is true only when both parts are true, so you take the minimum. A disjunction is true when at least one part is true, so you take the maximum.
v(P∧Q)=min⁡(1,0)=0,v(P∨Q)=max⁡(1,0)=1v(P \wedge Q) = \min(1, 0) = 0, \qquad v(P \vee Q) = \max(1, 0) = 1
Step 3: A conditional is false in exactly one case: the hypothesis is true and the conclusion is false. That case happens here.
v(P→Q)=0v(P \to Q) = 0
Answer: P ∧ Q is false, P ∨ Q is true, and P → Q is false.

Why It Matters

Every truth table is a list of truth values, one row for each possible assignment to the simple statements. In a discrete mathematics or intro-to-proofs course, you show that two statements are logically equivalent by checking that their truth values agree in every row. Digital circuit design uses the same 1/0 values: logic gates compute AND, OR, and NOT on voltages.

Common Mistakes

Mistake: Deciding that "If 4 is odd, then 4 = 10" is false because both of its parts are false.
Correction: A conditional P → Q is false only when P is true and Q is false. When the hypothesis is false, the conditional is true. This case is called vacuous truth. Check the hypothesis first.

Related Terms

  • Truth Table — Lists a statement's truth value in every case
  • Conjunction — True only when both parts are true
  • Disjunction — True when at least one part is true
  • Conditional — False only when true hypothesis meets false conclusion
  • Contrapositive — Always has the same truth value as the conditional
  • Converse — Can differ in truth value from the original
  • Counterexample — Shows a general statement has truth value false