Rules of Inference are the building blocks of logical reasoning in propositional logic. They help us draw valid conclusions from given premises, allowing us to construct sound arguments and proofs.

These rules, like and , are essential tools in Natural Deduction. They enable us to manipulate logical statements and derive new truths, forming the foundation for more complex logical reasoning.

Inference Rules for Conditional Statements

Modus Ponens

Top images from around the web for Modus Ponens
Top images from around the web for Modus Ponens
  • States that if a conditional statement is true and the antecedent is true, then the consequent must also be true
  • Symbolically represented as: (pq)pq(p \to q) \land p \vdash q
  • The pqp \to q is a conditional statement
  • The premise pp is the antecedent of the conditional statement
  • From these two premises, we can conclude qq, which is the consequent of the conditional statement
  • Allows us to draw conclusions based on the truth of a conditional statement and its antecedent (if it is raining, then the ground is wet)

Modus Tollens

  • States that if a conditional statement is true and the consequent is false, then the antecedent must also be false
  • Symbolically represented as: (pq)¬q¬p(p \to q) \land \neg q \vdash \neg p
  • The premise pqp \to q is a conditional statement
  • The premise ¬q\neg q is the negation of the consequent of the conditional statement
  • From these two premises, we can conclude ¬p\neg p, which is the negation of the antecedent of the conditional statement
  • Allows us to draw conclusions based on the truth of a conditional statement and the falsity of its consequent (if the ground is not wet, then it is not raining)

Hypothetical Syllogism

  • States that if two are true, and the consequent of the first is the antecedent of the second, then we can conclude a new conditional statement
  • Symbolically represented as: (pq)(qr)(pr)(p \to q) \land (q \to r) \vdash (p \to r)
  • The premise pqp \to q is a conditional statement
  • The premise qrq \to r is another conditional statement, where the antecedent qq matches the consequent of the first statement
  • From these two premises, we can conclude a new conditional statement prp \to r, where the antecedent is from the first statement and the consequent is from the second statement
  • Allows us to chain together conditional statements to form a new conditional statement (if it is raining, then the ground is wet; if the ground is wet, then it is slippery; therefore, if it is raining, then the ground is slippery)

Inference Rules for Disjunctions

Disjunctive Syllogism

  • States that if a is true, and one of the disjuncts is false, then the other disjunct must be true
  • Symbolically represented as: (pq)¬pq(p \lor q) \land \neg p \vdash q
  • The premise pqp \lor q is a disjunction
  • The premise ¬p\neg p is the negation of one of the disjuncts
  • From these two premises, we can conclude qq, which is the other disjunct
  • Allows us to conclude the truth of one disjunct based on the falsity of the other (either the car is red or blue; the car is not red; therefore, the car is blue)

Addition

  • States that if a statement is true, then any disjunction involving that statement is also true
  • Symbolically represented as: p(pq)p \vdash (p \lor q)
  • The premise pp is a statement
  • From this premise, we can conclude pqp \lor q, which is a disjunction involving the original statement and any other statement
  • Allows us to introduce a disjunction based on the truth of one of its disjuncts (the sky is blue; therefore, the sky is blue or the grass is green)

Inference Rules for Conjunctions

Conjunction

  • States that if two statements are true, then their is also true
  • Symbolically represented as: p,q(pq)p, q \vdash (p \land q)
  • The premises pp and qq are individual statements
  • From these premises, we can conclude pqp \land q, which is the conjunction of the two statements
  • Allows us to combine two true statements into a single conjunctive statement (the sun is shining; the birds are singing; therefore, the sun is shining and the birds are singing)

Simplification

  • States that if a conjunction is true, then each of its conjuncts is also true
  • Symbolically represented as: (pq)p(p \land q) \vdash p and (pq)q(p \land q) \vdash q
  • The premise pqp \land q is a conjunction
  • From this premise, we can conclude pp, which is one of the conjuncts
  • Similarly, we can also conclude qq, which is the other conjunct
  • Allows us to break down a conjunctive statement into its individual components (the apple is red and sweet; therefore, the apple is red; therefore, the apple is sweet)

Other Inference Rules

Double Negation

  • States that a statement is logically equivalent to its
  • Symbolically represented as: p¬(¬p)p \equiv \neg(\neg p)
  • The statement pp is equivalent to the negation of its negation, ¬(¬p)\neg(\neg p)
  • Double negation can be used to affirm a statement by negating its opposite (it is not the case that the door is not open; therefore, the door is open)
  • This rule allows for the of statements containing multiple negations (it is not not raining; therefore, it is raining)

Key Terms to Review (14)

Addition: Addition is a rule of inference in formal logic that allows one to infer a disjunction from a given statement. Essentially, if you know that a certain proposition is true, you can add any other proposition to it, forming a disjunction that is also true. This principle helps expand the logical possibilities derived from a single true statement and plays a crucial role in constructing valid arguments.
Conclusion: A conclusion is the statement or proposition that follows logically from the premises of an argument, serving as its endpoint and summarizing the reasoning provided. It plays a crucial role in determining the overall strength and effectiveness of arguments by showing what follows from the given premises.
Conditional Statements: Conditional statements are logical constructs that express a relationship between two propositions, typically structured in the form 'If P, then Q.' Here, P is called the antecedent, and Q is the consequent. These statements are foundational in understanding implications in logic, as they can be analyzed for truth values, converted into equivalent forms, and used as tools in various proof techniques.
Conjunction: In logic, a conjunction is a compound statement formed by connecting two propositions with the logical connective 'and', symbolized as $$P \land Q$$. This statement is true only when both of the component propositions are true, linking their truth values in a specific way that is essential for understanding logical relationships.
Disjunction: Disjunction is a logical connective that represents the logical operation of 'or' between two propositions, where the compound statement is true if at least one of the propositions is true. This concept is essential for understanding how propositions interact and form complex statements in logical reasoning.
Disjunctive Syllogism: Disjunctive syllogism is a valid argument form in logic that allows one to conclude a specific proposition based on the negation of one of its alternatives. It follows the structure: if you have 'A or B' and you know 'not A,' you can conclude 'B.' This pattern highlights how disjunctions can be used to deduce truth through elimination, making it a vital reasoning tool.
Double Negation: Double negation refers to the logical principle that negating a negation results in the affirmation of the original statement. In other words, if a statement is negated twice, it is equivalent to the original statement itself. This concept plays a crucial role in understanding truth values, logical equivalence, inference rules, and the handling of negation in both propositional and predicate logic.
Hypothetical syllogism: Hypothetical syllogism is a valid form of reasoning in formal logic that involves a chain of conditional statements. It allows us to infer a conclusion from two premises, each containing a conditional statement, where the consequent of one premise matches the antecedent of the other. This reasoning method is crucial in understanding logical implications, equivalences, argument patterns, rules of inference, and philosophical arguments.
Modus Ponens: Modus ponens is a fundamental rule of inference in formal logic that allows one to derive a conclusion from a conditional statement and its antecedent. It asserts that if we have a statement in the form of 'If P, then Q' and we know that P is true, then we can conclude that Q must also be true. This logical structure connects to various principles of reasoning and argumentation.
Modus Tollens: Modus Tollens is a valid argument form in deductive reasoning that states if a conditional statement is true, and the consequent is false, then the antecedent must also be false. This logical structure is foundational in understanding validity and soundness, especially in arguments involving implications.
Premise: A premise is a statement or proposition that provides the foundation for an argument, serving as the evidence or reason that supports the conclusion. Understanding premises is essential for analyzing the structure of arguments, distinguishing between valid and invalid forms, and assessing the overall soundness and cogency of reasoning.
Simplification: Simplification is a rule of inference in formal logic that allows one to derive a single proposition from a conjunction of propositions. This rule states that if you have a compound statement that is true, then each of the individual statements within that compound statement must also be true. It plays a crucial role in breaking down complex logical expressions into simpler components, making it easier to analyze and derive conclusions.
Soundness: Soundness refers to a property of deductive arguments where the argument is both valid and all of its premises are true, ensuring that the conclusion is necessarily true. This concept is crucial in determining the reliability of an argument, connecting validity to actual truthfulness and making it a cornerstone of logical reasoning.
Validity: Validity refers to the property of an argument where, if the premises are true, the conclusion must also be true. This concept is essential for evaluating logical arguments, as it helps determine whether the reasoning process used leads to a reliable conclusion based on the given premises.
© 2024 Fiveable Inc. All rights reserved.
AP® and SAT® are trademarks registered by the College Board, which is not affiliated with, and does not endorse this website.