Concept

List of rules of inference

This is a list of rules of inference, logical laws that relate to mathematical formulae. Rules of inference are syntactical transform rules which one can use to infer a conclusion from a premise to create an argument. A set of rules can be used to infer any valid conclusion if it is complete, while never inferring an invalid conclusion, if it is sound. A sound and complete set of rules need not include every rule in the following list, as many of the rules are redundant, and can be proven with the other rules. Discharge rules permit inference from a subderivation based on a temporary assumption. Below, the notation indicates such a subderivation from the temporary assumption to . Reductio ad absurdum (or Negation Introduction) Reductio ad absurdum (related to the law of excluded middle) Ex contradictione quodlibet Deduction theorem (or Conditional Introduction) Modus ponens (or Conditional Elimination) Modus tollens Adjunction (or Conjunction Introduction) Simplification (or Conjunction Elimination) Addition (or Disjunction Introduction) Case analysis (or Proof by Cases or Argument by Cases or Disjunction elimination) Disjunctive syllogism Constructive dilemma Biconditional introduction Biconditional elimination In the following rules, is exactly like except for having the term wherever has the free variable . Universal Generalization (or Universal Introduction) Restriction 1: is a variable which does not occur in . Restriction 2: is not mentioned in any hypothesis or undischarged assumptions. Universal Instantiation (or Universal Elimination) Restriction: No free occurrence of in falls within the scope of a quantifier quantifying a variable occurring in . Existential Generalization (or Existential Introduction) Restriction: No free occurrence of in falls within the scope of a quantifier quantifying a variable occurring in . Existential Instantiation (or Existential Elimination) Restriction 1: is a variable which does not occur in . Restriction 2: There is no occurrence, free or bound, of in .

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.