Topzle Topzle

Rule of inference

Updated: Wikipedia source

Rule of inference

Rules of inference are ways of deriving conclusions from premises. They are integral parts of formal logic, serving as the logical structure of valid arguments. If an argument with true premises follows a rule of inference then the conclusion cannot be false. Modus ponens, an influential rule of inference, connects two premises of the form "if P {\displaystyle P} then Q {\displaystyle Q} " and " P {\displaystyle P} " to the conclusion " Q {\displaystyle Q} ", as in the argument "If it rains, then the ground is wet. It rains. Therefore, the ground is wet." There are many other rules of inference for different patterns of valid arguments, such as modus tollens, disjunctive syllogism, constructive dilemma, and existential generalization. Rules of inference include 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. They contrast with formal fallacies—invalid argument forms involving logical errors. Logicians construct formal systems to precisely capture and codify valid patterns of reasoning, with distinct systems using different rules of inference. For example, propositional logic examines how statements formed through logical operators like "not" and "if.. ..." support conclusions. First-order logic extends propositional logic by analyzing how the internal structure of propositions, like names and predicates, influences reasoning. Other logical systems explore inferential patterns associated with what is possible and necessary, with what people believe, and with what happened at different times. Various formalisms are used to express logical systems. Natural deduction systems employ many intuitive rules of inference to reflect how people naturally reason, while Hilbert systems provide minimalistic frameworks to represent foundational principles without redundancy. Rules of inference are relevant to many areas, such as proofs in mathematics and automated reasoning in computer science. Their conceptual and psychological underpinnings are studied by philosophers of logic and cognitive psychologists.

Tables

Notable rules of inference · Systems of logic › Classical › Propositional logic
Modus ponens
Modus ponens
Rule of inference
Modus ponens
Form
P → Q P Q {\displaystyle {\begin{array}{l}P\to Q\\P\\\hline Q\end{array}}}
Example
If Kim is in Seoul, then Kim is in South Korea. Kim is in Seoul. Therefore, Kim is in South Korea.
Modus tollens
Modus tollens
Rule of inference
Modus tollens
Form
P → Q ¬ Q ¬ P {\displaystyle {\begin{array}{l}P\to Q\\\lnot Q\\\hline \lnot P\
Example
If Koko is a koala, then Koko is cuddly. Koko is not cuddly. Therefore, Koko is not a koala.
Hypothetical syllogism
Hypothetical syllogism
Rule of inference
Hypothetical syllogism
Form
P → Q Q → R P → R {\displaystyle {\begin{array
Example
If Leo is a lion, then Leo roars. If Leo roars, then Leo is fierce. Therefore, if Leo is a lion, then Leo is fierce.
Disjunctive syllogism
Disjunctive syllogism
Rule of inference
Disjunctive syllogism
Form
P ∨ Q ¬ P Q {\displaystyle {\begin{array}{l}P\lor Q\\\lnot P\\\hline Q\end{array}}}
Example
The book is on the shelf or on the table. The book is not on the shelf. Therefore, the book is on the table.
Double negation elimination
Double negation elimination
Rule of inference
Double negation elimination
Form
¬ ¬ P P {\displaystyle {\begin{array}{l}\lnot \lnot P\\\hline P\end{array}}}
Example
We were not unable to meet the deadline. We were able to meet the deadline.  {\displaystyle {\begin{array}{l}{\text{We were not unable to meet the deadline.}}\\\
Rule of inference
Form
Example
Modus ponens
P → {l}P\to Q\\P\\\hline Q\end{array}}}
If Kim is in Seoul, then Kim is in South Korea. Kim is in Seoul. Therefore, Kim is in South Korea.
Modus tollens
P → Q ¬ Q ¬ {l}P\to Q\\\lnot Q\\\hline \lnot P\
If Koko is a koala, then Koko is cuddly. Koko is not cuddly. Therefore, Koko is not a koala.
Hypothetical syllogism
P → Q Q → R P → R {\displaystyle {\begin{array
If Leo is a lion, then Leo roars. If Leo roars, then Leo is fierce. Therefore, if Leo is a lion, then Leo is fierce.
Disjunctive syllogism
P ∨ Q ¬ {l}P\lor Q\\\lnot P\\\hline Q\end{array}}}
The book is on the shelf or on the table. The book is not on the shelf. Therefore, the book is on the table.
Double negation elimination
¬ ¬ {l}\lnot \lnot P\\\hline P\end{array}}}
{l}{\text{We were not unable to meet the deadline.}}\\\
Notable rules of inference · Systems of logic › Classical › First-order logic
Universal instantiation
Universal instantiation
Rule of inference
Universal instantiation
Form
∀ x P ( x ) P ( a ) {\displaystyle {\begin{array}{l}\forall xP(x)\\\hline P(a)\end{arr
Example
Everyone must pay taxes. Therefore, Wesley must pay taxes. {\displaystyle {\begin{array}{l}{\text{Everyone must pay taxes.}}\\\hline {\text{Therefore, Wesley mus
Existential generalization
Existential generalization
Rule of inference
Existential generalization
Form
P ( a ) ∃ x P ( x ) {\displaystyle {\begin{array}{l}P(a)\\\hline \exists xP(x)\end{arr
Example
Socrates is mortal. Therefore, someone is mortal. {\displaystyle {\begin{array}{l}{\text{Socrates is mortal.}}\\\hline {\text{Therefore, someone is mortal.}}\end
Rule of inference
Form
Example
Universal instantiation
∀ x P ( x ) P ( a ) {\displaystyle {\begin{array}{l}\forall xP(x)\\\hline P(a)\end{arr
{l}{\text{Everyone must pay taxes.}}\\\hline {\text{Therefore, Wesley mus
Existential generalization
P ( a ) ∃ x P ( x ) {\displaystyle {\begin{array}{l}P(a)\\\hline \exists xP(x)\end{arr
{l}{\text{Socrates is mortal.}}\\\hline {\text{Therefore, someone is mortal.}}\end

References

  1. Non-deductive arguments, by contrast, support the conclusion without ensuring that it is true, such as inductive and abd
  2. The symbol → {\displaystyle \to } in this formula means if ... then ..., expressing material implication
  3. Universal instantiation infers a statement about a specific individual from a universal claim, as in the argument "Every
  4. The expression quod erat demonstrandum (abbreviated as Q .) is sometimes placed at the end of proofs to indicate that th
  5. There are different strategies used to formulate proofs. For example, reductio ad absurdum seeks to establish a conclusi
  6. Logical operators or constants are expressions used to form and connect propositions, such as not, or, and if.. ....
  7. According to a narrow definition, rules of inference only encompass rules of implication but do not include rules of rep
  8. Logicians use the symbols ¬ {\displaystyle \lnot } or ∼ {\displaystyle \sim } to express
  9. Rules of replacement are sometimes expressed using a double semi-colon. For instance, the double negation rule can be wr
  10. Additionally, formal systems may also define axioms or axiom schemas.
  11. Formal systems can have limitations about what can and cannot be proven in them, such as the limitations pointed out by
  12. This example assumes that a {\displaystyle a} refers to an individual in the domain of discourse.
  13. An important difference between first-order and second-order logic is that second-order logic is incomplete, meaning tha
  14. This situation is also known as a deductive explosion.
  15. The Fitch notation is an influential way of presenting proofs in natural deduction systems.
  16. Hurley 2016, p. 303 Hintikka & Sandu 2006, pp. 13–14 Carlson 2017, p. 20 Copi, Cohen & Flage 2016, pp. 244–245, 447
  17. Shanker 2003, p. 442 Cook 2009, p. 152
    https://books.google.com/books?id=jIzT7AT3ILIC&pg=PA442
  18. Hintikka & Sandu 2006, pp. 13–14 Löwe 2002, pp. 5–6 Agazzi 2016, p. 27 Nunes 2011, pp. 2066–2069
    https://books.google.com/books?id=nd0eEAAAQBAJ&pg=PA27
  19. Hurley 2016, pp. 54–55, 283–287 Arthur 2016, p. 165 Hintikka & Sandu 2006, pp. 13–14 Carlson 2017, p. 20 Copi, Cohen & F
    https://books.google.com/books?id=vEFVAgAAQBAJ&pg=PA88
  20. Schumann 2023, pp. 301–302
    https://books.google.com/books?id=sqEIEQAAQBAJ&pg=PA301
Image
Source:
Tip: Wheel or +/− to zoom, drag to pan, Esc to close.