Mathwords logoMathwords

Propositional Calculus — Definition, Formula & Examples

Propositional calculus is the branch of formal logic that studies how simple propositions (statements that are either true or false) combine through logical connectives like AND, OR, NOT, and IF...THEN to form compound propositions, and how the truth of those compounds depends on the truth of their parts.

Propositional calculus (also called propositional logic or sentential logic) is a formal system consisting of a set of propositional variables, logical connectives (¬,∧,∨,→,↔\lnot, \land, \lor, \rightarrow, \leftrightarrow), well-formed formula construction rules, a truth-value assignment function vv mapping each formula to {T,F}\{T, F\}, and a collection of axioms and inference rules (such as modus ponens) sufficient to derive all tautologies.

How It Works

You start by assigning letters like pp and qq to simple declarative statements. Then you build compound statements using connectives: ¬\lnot (not), ∧\land (and), ∨\lor (or), →\rightarrow (if...then), and ↔\leftrightarrow (if and only if). Each connective has a truth table that determines the compound's truth value from the components' truth values. You can then check whether a formula is a tautology (always true), a contradiction (always false), or contingent (depends on the assignment). Inference rules like modus ponens (pp, p→qp \rightarrow q, therefore qq) let you derive new truths from known ones without building full truth tables.

Worked Example

Problem: Let p = "It is raining" and q = "The ground is wet." Determine the truth value of (p∧(p→q))→q(p \land (p \rightarrow q)) \rightarrow q when p is true and q is false.
Step 1: Evaluate the conditional p→qp \rightarrow q. When pp is true and qq is false, a conditional is false.
p→q=T→F=Fp \rightarrow q = T \rightarrow F = F
Step 2: Evaluate the conjunction p∧(p→q)p \land (p \rightarrow q). True AND false gives false.
p∧F=Fp \land F = F
Step 3: Evaluate the outer conditional. When the antecedent is false, the conditional is automatically true.
F→q=F→F=TF \rightarrow q = F \rightarrow F = T
Answer: The formula evaluates to T (true). In fact, this formula is a tautology — it is true for every possible assignment of truth values to p and q. It captures the logical principle of modus ponens.

Why It Matters

Propositional calculus is the foundation of mathematical proof, digital circuit design, and programming language semantics. Courses in discrete mathematics, computer science theory, and philosophy of logic all begin here. Understanding it lets you verify arguments rigorously and build toward predicate logic, where quantifiers like "for all" and "there exists" enter the picture.

Common Mistakes

Mistake: Assuming p→qp \rightarrow q is false whenever pp is false.
Correction: A conditional p→qp \rightarrow q is false only when pp is true and qq is false. In all other cases — including when pp is false — the conditional is true. This "vacuous truth" rule is essential to propositional calculus.