CS 121 › Lesson 2 of 12

Propositional Logic & Truth Tables

Lesson 2 · OKSTEM College · AS Computer Science

Propositional Logic & Truth Tables

A proposition is a statement that is either true or false. We combine propositions using logical connectives.

ConnectiveSymbolNameTrue when
NOT¬pNegationp is false
ANDp ∧ qConjunctionBoth true
ORp ∨ qDisjunctionAt least one true
IF…THENp → qImplicationNot (p true AND q false)
IFFp ↔ qBiconditionalp and q have same truth value

Implication: p → q is false ONLY when p is true and q is false. "If it rains, the ground is wet" is NOT falsified by dry weather with no rain.

Worked Example — Truth Table for p → q

Write all combinations of p and q: TT, TF, FT, FF
Apply rule: p→q is false only when p=T, q=F
TT→T, TF→F, FT→T, FF→T
Memorize: "False implies anything" (vacuously true)

Lab — Interactive Truth Table Builder

Knowledge Check

p → q (implication) is FALSE only when

p ↔ q (biconditional) is true when

A tautology is

Which connective corresponds to 'exclusive or'?

'If it is Sunday then there is no mail' — the hypothesis is

← PreviousNext →