1 Foundations
Classical logic is the traditional framework for analyzing valid inference. It treats propositions as having determinate truth values and studies the relations that preserve truth from premises to conclusion. The system became central in mathematics and philosophy because it offers a precise way to distinguish valid arguments from invalid ones.
1.1 Historical development
Classical logic draws on ancient Greek logic, especially the work associated with Aristotle, whose syllogistic analysis of arguments influenced later formal reasoning. During the nineteenth and early twentieth centuries, logic was transformed into a symbolic discipline through the work of Boole, Frege, Peirce, Russell, and others. Their efforts produced formal languages and proof methods that made logic suitable for mathematical study. In modern form, classical logic is often identified with propositional and first-order logic.
1.2 Core assumptions
Classical logic rests on several interconnected assumptions about truth, contradiction, and inference. These principles are often treated as basic features of ordinary reasoning, though they are also the source of later alternatives.
1.2.1 Bivalence
Bivalence is the view that every well-formed statement is either true or false. It allows logical analysis to proceed by assigning one of two truth values to each proposition. Classical semantics depends heavily on this two-valued framework.
1.2.2 Excluded middle
The law of excluded middle states that for any proposition, either that proposition is true or its negation is true. It expresses the idea that there is no third truth value between truth and falsity. In classical reasoning, this principle supports many standard proof techniques.
1.2.3 Non-contradiction
The law of non-contradiction holds that a statement and its negation cannot both be true in the same respect at the same time. It protects logical systems from triviality by preventing contradictory claims from being accepted together. This principle is central to the classical conception of consistency.
1.3 Formal language
Classical logic is expressed through formal languages designed to remove ambiguity. These languages use symbols with fixed meanings and rules for combining them into meaningful expressions. Formalization makes arguments easier to analyze and compare.
1.3.1 Symbols and syntax
A classical logical language contains symbols for variables, connectives, quantifiers, predicates, and sometimes identity. Syntax specifies how these symbols may be arranged. The rules are purely formal, so they determine which strings count as legitimate expressions without appealing to meaning.
1.3.2 Well-formed formulas
Well-formed formulas are expressions that obey the syntactic rules of the language. They may represent atomic statements or more complex structures built from simpler ones. The distinction between well-formed and ill-formed expressions is essential for defining proofs and semantic interpretation.
2 Propositional logic
Propositional logic studies arguments formed from whole propositions and logical connectives. It abstracts from the internal structure of statements and focuses on how truth values are transmitted through compound forms. This makes it a foundational level of classical logical analysis.
2.1 Propositional variables
Propositional variables stand for simple statements that are taken as units of evaluation. They are often written as letters such as P, Q, and R. Each variable can be assigned a truth value in a given interpretation.
2.2 Logical connectives
Logical connectives combine propositions into more complex statements. Their meanings are defined by their truth conditions, which determine how the truth value of the compound depends on the truth values of its parts.
2.2.1 Negation
Negation reverses the truth value of a proposition. If a statement is true, its negation is false, and vice versa. It is commonly represented by a symbol such as ¬.
2.2.2 Conjunction
Conjunction joins two propositions with the sense of “and.” A conjunction is true only when both of its components are true. It is usually symbolized by ∧.
2.2.3 Disjunction
Disjunction corresponds to “or” in the inclusive sense. A disjunction is true when at least one of its components is true. It is commonly represented by ∨.
2.2.4 Material implication
Material implication links antecedent and consequent in a conditional statement. In classical logic, it is false only when the antecedent is true and the consequent is false. It is usually symbolized by →.
2.2.5 Biconditional
The biconditional expresses equivalence between two propositions. It is true when both sides have the same truth value, whether both are true or both are false. It is often written as ↔.
2.3 Truth tables
Truth tables display the truth values of compound statements across all possible combinations of component values. They provide a systematic method for checking logical equivalence and validity. Because the classical system is two-valued, truth tables are especially effective in propositional logic.
2.4 Tautologies and contradictions
A tautology is a formula that is true under every possible assignment of truth values. A contradiction is false under every assignment. These notions help classify formulas according to their logical status rather than their subject matter.
2.5 Inference rules
Inference rules specify valid patterns of reasoning. They allow one to derive conclusions from premises in a formally acceptable way. In classical logic, such rules are central to proof construction.
2.5.1 Modus ponens
Modus ponens allows one to infer a consequent from a conditional statement and its antecedent. From “If P, then Q” and “P,” one may conclude “Q.” It is one of the most familiar and widely used forms of deductive reasoning.
2.5.2 Modus tollens
Modus tollens infers the negation of an antecedent from a conditional statement and the negation of its consequent. From “If P, then Q” and “not Q,” one may conclude “not P.” It is a standard tool in formal proof.
2.5.3 Hypothetical syllogism
Hypothetical syllogism chains conditionals together. From “If P, then Q” and “If Q, then R,” one may infer “If P, then R.” This rule captures the transitive structure of conditional reasoning.
3 Predicate logic
Predicate logic extends propositional logic by analyzing the internal structure of statements. It introduces quantification, predicates, and variables, making it possible to represent claims about objects and their properties. This extension greatly increases expressive power.
3.1 Quantifiers
Quantifiers indicate how many objects in a domain satisfy a predicate. They are crucial for expressing general and existential claims. Classical first-order logic typically uses two principal quantifiers.
3.1.1 Universal quantifier
The universal quantifier expresses that a predicate holds of every object in a domain. It is commonly symbolized by ∀. Statements of this type are used to state general laws, definitions, and universal claims.
3.1.2 Existential quantifier
The existential quantifier expresses that at least one object in a domain satisfies a predicate. It is commonly symbolized by ∃. This form is used to assert existence without identifying a specific object.
3.2 Predicates and terms
Predicates represent properties or relations, while terms denote objects. A predicate applied to terms forms an atomic formula. This structure allows logic to represent not just that something is the case, but what is the case.
3.3 Variables and binding
Variables range over objects in a domain and can be free or bound. A quantifier binds a variable when it specifies the range of objects under discussion. The distinction between free and bound variables is important for determining the meaning of formulas.
3.4 Identity and equality
Identity expresses that two terms refer to the same object. In classical logic, equality is usually governed by principles that allow substitution of identicals. This makes it possible to reason rigorously about sameness and difference.
3.5 Quantifier negation
Quantifier negation describes how negation interacts with quantifiers. The negation of a universal statement becomes an existential statement with a negated predicate, and the negation of an existential statement becomes a universal statement with a negated predicate. These transformations are central to formal proof and interpretation.
4 Semantics
Semantics explains how logical expressions receive meaning and truth values. In classical logic, semantic analysis connects formal syntax with models that assign interpretations to symbols. This relationship determines when a formula is true, false, valid, or satisfiable.
4.1 Interpretations and models
An interpretation assigns meanings to nonlogical symbols such as predicates, constants, and function symbols. A model is a structure in which formulas can be evaluated relative to that interpretation. Models provide the semantic setting for measuring logical consequence.
4.2 Truth conditions
Truth conditions specify what must be the case for a formula to be true in a model. Different connectives and quantifiers have different conditions, which are defined recursively. These conditions give classical logic its compositional character.
4.3 Logical consequence
A conclusion is a logical consequence of premises when it must be true in every model where the premises are true. This notion captures validity in a semantic way. It links the concept of inference to preservation of truth across all possible interpretations.
4.4 Satisfiability
A formula or set of formulas is satisfiable if there exists at least one model in which all of them are true. Satisfiability is the counterpart to inconsistency. It is an important concept in logic, mathematics, and automated reasoning.
4.5 Validity and invalidity
A formula is valid if it is true in every model under every relevant assignment. An argument is valid if the truth of its premises guarantees the truth of its conclusion. Invalidity occurs when there is some interpretation in which the premises are true and the conclusion is false.
5 Proof theory
Proof theory studies formal derivations and the structure of deductive systems. It examines how conclusions can be obtained from premises according to explicit rules. Classical proof theory includes several formal traditions.
5.1 Axiomatic systems
Axiomatic systems begin with selected axioms and infer new formulas by rules of derivation. They aim to reduce reasoning to a small set of primitive principles. Such systems were historically influential in the development of formal logic.
5.2 Natural deduction
Natural deduction is a proof style designed to mirror ordinary reasoning closely. It uses introduction and elimination rules for logical operators. The system is valued for its clarity and its suitability for both proof construction and philosophical analysis.
5.3 Sequent calculus
Sequent calculus represents deductions as transformations between sequences of formulas. It is well suited to studying proof structure and cut-elimination. This formalism has been influential in proof theory and automated reasoning.
5.4 Soundness
Soundness means that every provable formula is semantically valid. If a proof system is sound, it never derives false conclusions from true premises. This property ensures reliability of the formal calculus.
5.5 Completeness
Completeness means that every semantically valid formula is provable in the system. For classical first-order logic, completeness is a landmark result showing that semantic validity and formal derivability coincide. It demonstrates a deep harmony between syntax and semantics.
6 Classical logical laws
Classical logic is often characterized by a group of standard logical laws. These laws summarize recurring patterns of valid transformation and inference. They are frequently used in proof, analysis, and simplification.
6.1 Law of excluded middle
The law of excluded middle states that any proposition or its negation must hold. It supports case-based reasoning and many classical demonstrations. In two-valued semantics, it is universally valid.
6.2 Law of non-contradiction
The law of non-contradiction prohibits a proposition and its negation from both being true together. It underlies the distinction between consistent and inconsistent theories. Classical logic treats this law as fundamental.
6.3 Double negation elimination
Double negation elimination allows one to infer a statement from the negation of its negation. In classical logic, ¬¬P entails P. This principle is accepted in classical systems but not in all non-classical ones.
6.4 De Morgan's laws
De Morgan's laws describe how negation distributes over conjunction and disjunction. The negation of a conjunction becomes a disjunction of negations, and the negation of a disjunction becomes a conjunction of negations. These equivalences are widely used in symbolic manipulation.
6.5 Distribution laws
Distribution laws govern the interaction of conjunction and disjunction. They allow one connective to be distributed over the other under appropriate conditions. Such laws help in normalizing formulas and simplifying logical expressions.
7 Classical argument forms
Classical logic classifies arguments by their inferential pattern. Some patterns are valid and preserve truth, while others are formally defective despite appearing persuasive. This section highlights common examples.
7.1 Deductive validity
A deductive argument is valid when its conclusion follows necessarily from its premises. Validity depends on form rather than subject matter. In a valid deduction, it is impossible for the premises to be true and the conclusion false at the same time.
7.2 Common valid arguments
Several standard argument patterns recur in classical reasoning. They are widely taught because they illustrate how formal validity works in practice.
7.2.1 Categorical syllogisms
Categorical syllogisms involve statements about classes and their inclusion relations. They were studied extensively in traditional logic and remain a classic example of valid inference. Their force depends on the arrangement of terms across the premises and conclusion.
7.2.2 Conditional reasoning
Conditional reasoning uses “if-then” statements to derive further conclusions. When properly structured, it supports reliable inference from antecedent to consequent or through linked conditionals. It is central to both formal proof and everyday argument analysis.
7.3 Fallacies
Fallacies are argument forms that seem plausible but do not guarantee truth preservation. Classical logic identifies them by counterexample or by showing that their form does not support valid inference. Recognizing fallacies is an important part of logical education.
7.3.1 Affirming the consequent
Affirming the consequent infers the antecedent from the truth of the consequent in a conditional statement. From “If P, then Q” and “Q,” one cannot validly conclude “P.” The same conclusion may have other causes or explanations.
7.3.2 Denying the antecedent
Denying the antecedent infers the negation of the consequent from the negation of the antecedent. From “If P, then Q” and “not P,” one cannot conclude “not Q.” The conditional does not rule out cases where Q holds for other reasons.
8 Relations to other logical systems
Classical logic is one among several logical frameworks. Later systems often modify classical assumptions about truth, contradiction, or necessity. These alternatives help clarify both the strengths and the limits of the classical approach.
8.1 Non-classical logics
Non-classical logics alter one or more classical principles. They may reject bivalence, allow controlled contradictions, or add modal distinctions. Such systems expand the range of formal analysis beyond the classical setting.
8.1.1 Intuitionistic logic
Intuitionistic logic emphasizes constructive proof and does not accept some classical principles, including unrestricted excluded middle. A statement is accepted when it can be proved, not merely when it cannot be refuted. This approach has been influential in foundations and computer science.
8.1.2 Paraconsistent logic
Paraconsistent logic is designed to handle contradictions without collapsing into triviality. It permits some inconsistent sets of statements while preventing every conclusion from following. This makes it useful for reasoning in the presence of conflict or incomplete information.
8.1.3 Modal logic
Modal logic adds operators for necessity and possibility. Although often built on classical foundations, it introduces a richer treatment of modality. It is used to study necessity, possibility, time, knowledge, and related notions.
8.2 Classical logic in mathematics
Classical logic has long served as the standard background logic of mathematics. It underlies proof by contradiction, standard set theory, and much of ordinary mathematical practice. Many mathematical theorems are traditionally stated and proved within a classical framework.
8.3 Classical logic in computer science
Classical logic influences areas such as program verification, database theory, and automated theorem proving. It provides a formal language for specifying conditions and checking correctness. In some settings, however, constructive or other non-classical logics are preferred for computational reasons.
9 Applications and influence
Classical logic has had broad influence across disciplines. Its formal methods provide tools for clarification, analysis, and rigorous demonstration. The system remains a key reference point in both theory and practice.
9.1 Mathematics
In mathematics, classical logic supports proof, definition, and theorem formulation. It is especially important in algebra, analysis, set theory, and foundational studies. Many mathematical arguments are organized by classical inferential principles.
9.2 Philosophy
Philosophers use classical logic to analyze argument structure, necessity, language, and metaphysical claims. It offers a shared framework for discussing validity and consistency. Debates about truth, reference, and rational justification often rely on classical logical tools.
9.3 Linguistics
In linguistics, classical logic contributes to the formal study of meaning and sentence structure. It helps represent quantification, negation, and semantic relations in natural language. Logical form is an important concept in semantic analysis.
9.4 Computer science
Computer science applies classical logic in specification, verification, circuit design, and algorithmic reasoning. Boolean algebra and logical circuits are closely related to classical propositional logic. Formal methods often use classical reasoning to prove properties of systems.
10 Critiques and limitations
Classical logic is powerful, but it is not universally accepted as the best framework for every purpose. Critics question some of its assumptions and note cases where alternative systems may model reasoning more faithfully. These critiques have encouraged the development of richer logical traditions.
10.1 Semantic and philosophical objections
Some objections focus on bivalence and the treatment of vague, incomplete, or future-directed statements. Others question whether material implication captures the ordinary meaning of conditionals. Philosophical debate has also addressed whether all meaningful discourse fits a strict true-or-false scheme.
10.2 Alternative logics
Alternative logics adjust classical rules to better handle specific phenomena. Constructive logics emphasize proof content, paraconsistent systems manage inconsistency, and many-valued logics allow more than two truth values. These systems show that classical logic is powerful without being exhaustive.
10.3 Scope of applicability
Classical logic works best in contexts where precise propositions, stable truth values, and clear inferential relations are available. In areas involving vagueness, incomplete information, or special semantic constraints, its assumptions may be too restrictive. Even so, it remains the most widely taught and foundational logical system in formal study.