What Is Propositional Logic? Truth Functions & Connectives

Direct Answer

Propositional logic — also called sentential logic or the propositional calculus — is the formal system that studies reasoning at the level of whole statements, or propositions. Its basic units are simple propositions like "it is raining" or "2 is prime," and its central question is how the truth of complex statements depends on the truth of their parts. This dependence is mediated by five logical connectives:

• Negation (not, ¬): flips truth — ¬P is true exactly when P is false.
• Conjunction (and, ∧): true only when both conjuncts are true.
• Disjunction (or, ∨): true when at least one disjunct is true.
• Conditional (if...then, →): false only when the antecedent is true and the consequent is false.
• Biconditional (if and only if, ↔): true when both sides have the same truth value.

Each connective is a truth function: given the truth values of its inputs, the output is uniquely determined. Because of this, the truth value of any complex formula — no matter how long — is fixed by the truth values of its atomic propositions, and validity can be tested mechanically with truth tables.

Historical Context

The seeds of propositional logic lie in the ancient Stoic school, whose logic of conditionals and disjunctions (including the inference forms later called modus ponens and modus tollens) anticipated truth-functional reasoning. But the modern system emerged in the nineteenth century. George Boole's An Investigation of the Laws of Thought (1854) treated reasoning as algebra over the values 0 and 1, founding Boolean algebra. Gottlob Frege's Begriffsschrift (1879) gave propositional logic its modern notation and axiomatic form. Bertrand Russell and Alfred North Whitehead's Principia Mathematica (1910–1913) made the propositional calculus the foundation of their attempt to derive all mathematics from logic.

Ludwig Wittgenstein's Tractatus Logico-Philosophicus (1921) gave truth tables their canonical place: for Wittgenstein, the truth functions revealed the very nature of logical truth — tautologies, statements true under every assignment, were the "scaffolding" of the world, saying nothing but showing logical form. Emil Post and others completed the metatheory in the 1920s, proving that the propositional calculus is complete and consistent: every tautology is provable, and nothing false is provable.

Philosophical Significance

Propositional logic matters because it is the cleanest possible demonstration that reasoning can be mechanized. Since every connective is a truth function, deciding validity in propositional logic is a purely mechanical procedure: enumerate the truth-value assignments and check. This was the first hint of what computation could do, and it is no accident that Boolean algebra became the mathematics of digital circuits: a computer's gates literally implement conjunction, disjunction, and negation.

The philosophy of logic asks what this tells us about reasoning. The material conditional "→" famously diverges from ordinary "if...then" — "if the moon is made of cheese, then 2+2=4" is true in propositional logic, since the antecedent is false — which sparked the study of strict and relevance logics. Wittgenstein's claim that tautologies say nothing also ignited the debate over what logical truths are: mere consequences of symbolism, or deep features of reality? The question remains open, and propositional logic is where it is most sharply posed.

Examples

Translating ordinary language:

• "It is raining and cold" → R ∧ C
• "You may have tea or coffee" → T ∨ C
• "If you study, you will pass" → S → P

Testing validity with truth tables. The inference modus ponens, P → Q, P ⊢ Q, is valid: in every row where both premises are true, the conclusion is true.

Tautology vs. contradiction:

• P ∨ ¬P (law of excluded middle) is true under every assignment — a tautology.
• P ∧ ¬P is false under every assignment — a contradiction.
• P is true under some assignments and false under others — contingent.

Related Concepts

Propositional logic is the simplest layer of logic; predicate logic extends it with quantifiers and variables. Its central tool is the truth table, its rules include modus ponens and modus tollens, and its semantics define logical consequence. Historically it grows out of Boole's algebra and Frege's logicism, and its philosophical limits are debated in the philosophy of logic.

Further Learning

The Internet Encyclopedia of Philosophy's "Propositional Logic" entry is an excellent technical introduction. For the historical and philosophical dimension, read the Stanford Encyclopedia entries "Classical Logic" and "The Propositional Calculus," and Wittgenstein's Tractatus for the philosophical vision of truth functions. For practice, any modern logic textbook — e.g., forall x by P. D. Magnus, freely available — provides drills in translation, truth tables, and proof.