Rule of inference
Norms for deriving conclusions from premises in deductive logic.
A rule of inference is a method for deriving a conclusion from given premises, also known as an inference rule or transformation rule. It acts as a standard for correct reasoning, helping to guide arguments, justify conclusions, and critique faulty ones. Within deductive logic, these rules are argument forms that guarantee truth is preserved: if the premises are true, the conclusion must also be true. They form the backbone of formal logic, providing the structure for valid arguments. For instance, modus ponens is a well-known rule that takes two premises—one stating "if P then Q" and the other stating "P"—and leads to the conclusion "Q." An example would be: "If it rains, then the ground is wet. It rains. Therefore, the ground is wet." Many other rules exist for different valid argument patterns, such as modus tollens, disjunctive syllogism, constructive dilemma, and existential generalization.
Rules of inference include two main types: rules of implication, which work in one direction from premises to conclusion, and rules of replacement, which state that two expressions are equivalent and can be swapped freely. These rules are distinct from formal fallacies, which are invalid argument forms that contain logical errors. Logicians build formal systems to precisely capture and codify valid reasoning patterns, with different systems using different sets of rules. For example, propositional logic examines how statements formed with logical operators like "not" and "if...then..." support conclusions, while first-order logic extends this by analyzing the internal structure of propositions, such as names and predicates. Other logical systems explore patterns related to possibility and necessity, beliefs, or events across time. Various formalisms express these systems: natural deduction uses many intuitive rules to mirror natural human reasoning, while Hilbert systems offer minimal frameworks that represent foundational principles without redundancy.
Rules of inference are relevant in many fields, including mathematical proofs and automated reasoning in computer science. Their conceptual and psychological foundations are studied by philosophers of logic and cognitive psychologists.
- field
- Formal logic
- known_for
- Providing the logical structure of valid arguments; examples include modus ponens, modus tollens, disjunctive syllogism, and constructive dilemma
- types
- Rules of implication (one-directional) and rules of replacement (bidirectional)
- contrast
- Formal fallacies (invalid argument forms involving logical errors)
Lore & Background
Rules of inference describe the structure of arguments, which consist of premises that support a conclusion. Whether an inference is deductively valid depends only on the form or syntactic structure of the premises and the conclusion, not on the actual content or concrete meaning of the statements. For instance, modus ponens connects two premises of the form 'if P then Q' and 'P' to the conclusion 'Q', and any argument following this pattern is valid regardless of the specific meanings of P and Q.
Logicians distinguish two types of rules: rules of implication, which operate only in one direction from premises to conclusions, and rules of replacement, which state that two expressions are equivalent and can be freely swapped. Rules of implication apply only to complete statements, while rules of replacement can be applied to any part of a compound statement. Deductive rules of inference differ from defeasible argumentation schemes, which provide some support to a conclusion without guaranteeing its truth.
Rules of inference are part of logical systems, and different systems employ distinct sets of rules. For example, universal instantiation is a rule in first-order logic but not in propositional logic. They play a central role in proofs as explicit procedures for deriving new lines from preceding lines. Various formalisms are used to express logical systems, such as natural deduction systems with many intuitive rules and Hilbert systems with minimalistic frameworks.
Reader's Guide
Rules of inference are foundational to formal logic, providing the syntactic structure that ensures valid reasoning. They are relevant to many areas, including proofs in mathematics and automated reasoning in computer science. Their conceptual and psychological underpinnings are studied by philosophers of logic and cognitive psychologists. One of the first discussions of formal rules of inference dates to antiquity in Aristotle's logic, with further refinements in medieval and early modern philosophy. The development of symbolic logic in the 19th century, such as George Boole's articulation of Boolean algebra, led to many additional rules for classical propositional and first-order logic. In the 20th and 21st centuries, logicians developed various non-classical systems with alternative rules of inference. Rules of inference are definitory rules—rules about which inferences are allowed—contrasting with strategic rules, which govern the steps needed to prove a theorem from specific premises. Mastering definitory rules alone is not sufficient for effective reasoning, as they provide little guidance on how to reach an intended conclusion.
Did You Know?
- Modus ponens is a rule of inference that connects two premises of the form 'if P then Q' and 'P' to the conclusion 'Q'.
- Rules of inference include rules of implication, which operate only in one direction, and rules of replacement, which state that two expressions are equivalent and can be freely swapped.
- Deductive rules of inference differ from defeasible argumentation schemes, such as argument from authority and argument from analogy.
- One of the first discussions of formal rules of inference dates to antiquity in Aristotle's logic.
More in Set Theory & Logic 1-19
Spotted an error? Know more?
This is a living reference — every entry is fact-audited, and reader corrections feed straight into our audit queue. Suggest an edit · See this site's audit record