|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Transformation rules}}
| | Hi there! :) My name is Gertrude, I'm a student studying Educational Studies from Acceglio, Italy.<br><br>Also visit my homepage ... [https://www.youtube.com/watch?v=f60jXlCtjoc Megapolis Hack] |
| | |
| In [[logic]], a '''rule of inference''', '''inference rule''', or '''transformation rule''' is a [[logical form]] consisting of a function which takes premises, analyzes their [[Syntax (logic)|syntax]], and returns a conclusion (or [[multiple-conclusion logic|conclusions]]). For example, the rule of inference called ''[[modus ponens]]'' takes two premises, one in the form "If p then q" and another in the form "p", and returns the conclusion "q". The rule is valid with respect to the semantics of [[classical logic]] (as well as the semantics of many other [[non-classical logic]]s), in the sense that if the premises are true (under an interpretation), then so is the conclusion.
| |
| | |
| Typically, a rule of inference preserves truth, a semantic property. In [[many-valued logic]], it preserves a general designation. But a rule of inference's action is purely syntactic, and does not need to preserve any semantic property: any function from sets of formulae to formulae counts as a rule of inference. Usually only rules that are [[Recursion|recursive]] are important; i.e. rules such that there is an [[effective procedure]] for determining whether any given formula is the conclusion of a given set of formulae according to the rule. An example of a rule that is not effective in this sense is the infinitary [[ω-rule]].<ref>{{Cite book | last1 = Boolos | first1 = George | last2 = Burgess | first2 = John | last3 = Jeffrey | first3 = Richard C. | title = Computability and logic | year = 2007 | publisher = Cambridge University Press | location = Cambridge | isbn = 0-521-87752-0 | page = 364 }}</ref>
| |
| | |
| Popular rules of inference in [[propositional logic]] include ''[[modus ponens]]'', ''[[modus tollens]]'', and [[contraposition]]. First-order [[predicate logic]] uses rules of inference to deal with [[logical quantifier]]s.
| |
| | |
| ==The standard form of rules of inference==
| |
| In [[formal logic]] (and many related areas), rules of inference are usually given in the following standard form:
| |
| | |
| Premise#1
| |
| <br> Premise#2
| |
| <br> '''...'''
| |
| <br><u> Premise#n </u>
| |
| <br> Conclusion
| |
| | |
| This expression states that whenever in the course of some logical derivation the given premises have been obtained, the specified conclusion can be taken for granted as well. The exact formal language that is used to describe both premises and conclusions depends on the actual context of the derivations. In a simple case, one may use logical formulae, such as in:
| |
| | |
| A→B
| |
| <br><u> A </u>
| |
| <br> B
| |
| | |
| This is the ''[[modus ponens]]'' rule of [[propositional logic]]. Rules of inference are often formulated as [[schema (logic)|schemata]] employing [[metavariable]]s.<ref name="Reynolds2009"/> In the rule (schema) above, the metavariables A and B can be instantiated to any element of the universe (or sometimes, by convention, a restricted subset such as [[Proposition (philosophy)|propositions]]) to form an [[infinite set]] of inference rules.
| |
| | |
| A proof system is formed from a set of rules chained together to form proofs, also called ''derivations''. Any derivation has only one final conclusion, which is the statement proved or derived. If premises are left unsatisfied in the derivation, then the derivation is a proof of a ''hypothetical'' statement: "''if'' the premises hold, ''then'' the conclusion holds."
| |
| | |
| == Axiom schemas and axioms ==
| |
| {{original research|section|date=November 2012}}
| |
| Inference rules may also be stated in this form: (1) zero or more premises, (2) a [[turnstile (symbol)|turnstile]] symbol <math> \vdash </math>, which means "infers", "proves", or "concludes", and (3) a conclusion. This form usually embodies the relational (as opposed to functional) view of a rule of inference, where the turnstile stands for a [[logical consequence|deducibility relation]] holding between premises and conclusion.
| |
| | |
| An inference rule containing no premises is called an [[axiom schema]] or, if it contains no [[metavariable]]s, simply an [[axiom]].<ref name="Reynolds2009">{{cite book|author=John C. Reynolds|title=Theories of Programming Languages|url=http://books.google.com/books?id=2OwlTC4SOccC&pg=PA12|year=2009|origyear=1998|publisher=Cambridge University Press|isbn=978-0-521-10697-9|page=12}}</ref>
| |
| | |
| Rules of inference must be distinguished from [[axiom]]s of a theory. In terms of semantics, axioms are valid assertions. Axioms are usually regarded as starting points for applying rules of inference and generating a set of conclusions. Or, in less technical terms:
| |
| | |
| Rules are statements ''about'' the system, axioms are statements ''in'' the system. For example:
| |
| * The rule that from <math>\vdash p</math> you can infer <math>\vdash\text{Provable}(p)</math> is a statement that says if you've proven <math>p</math>, then it is provable that <math>p</math> is provable. This rule holds in [[Peano arithmetic]], for example.
| |
| * The axiom <math>p \to \text{Provable}(p)</math> would mean that every true statement is provable. This axiom does not hold in Peano arithmetic.
| |
| | |
| Rules of inference play a vital role in the specification of [[Formal system|logical calculi]] as they are considered in [[proof theory]], such as the [[sequent calculus]] and [[natural deduction]].
| |
| | |
| == Example: Hilbert systems for two propositional logics ==
| |
| In a [[Hilbert system]], the premises and conclusion of the inference rules are simply formulae of some language, usually employing metavariables. For graphical compactness of the presentation and to emphasize the distinction between axioms and rules of inference, this section uses the sequent notation (⊢) instead of a vertical presentation of rules.
| |
| | |
| The formal language for classical [[propositional logic]] can be expressed using just negation (¬), implication (→) and propositional symbols. A well-known axiomatization, comprising three axiom schema and one inference rule (''modus ponens''), is:
| |
| | |
| (CA1) ⊢ ''A'' → (''B'' → ''A'')<br/>
| |
| (CA2) ⊢ (''A'' → (''B'' → ''C'')) → ((''A'' → ''B'') → (''A'' → ''C''))<br/>
| |
| (CA3) ⊢ (¬''A'' → ¬''B'') → (''B'' → ''A'')<br/>
| |
| (MP) ''A'', ''A'' → ''B'' ⊢ ''B''
| |
| | |
| It may seem redundant to have two notions of inference in this case, ⊢ and →. In classical propositional logic, they indeed coincide; the [[deduction theorem]] states that ''A'' ⊢ ''B'' if and only if ⊢ ''A'' → ''B''. There is however a distinction worth emphasizing even in this case: the first notation describes a [[Deductive reasoning|deduction]], that is an activity of passing from sentences to sentences, whereas ''A'' → ''B'' is simply a formula made with a [[logical connective]], implication in this case. Without an inference rule (like ''modus ponens'' in this case), there is no deduction or inference. This point is illustrated in [[Lewis Carroll]]'s dialogue called "[[What the Tortoise Said to Achilles]]".<ref name="ChiaraDoets1996">{{cite book|editor=Maria Luisa Dalla Chiara, Kees Doets, Daniele Mundici, Johan van Benthem|title=Logic and Scientific Methods: Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995|url=http://books.google.com/books?id=TCthvF8xLIAC&pg=PA290|year=1996|publisher=Springer|isbn=978-0-7923-4383-7|page=290|chapter=Logical consequence: a turn in style|author=Kosta Dosen}} [http://www.mi.sanu.ac.rs/~kosta/LOGCONS.pdf preprint (with different pagination)]</ref>
| |
| | |
| For some non-classical logics, the deduction theorem does not hold. For example, the [[Three-valued_logic#.C5.81ukasiewicz_logic|three-valued logic Ł3 of Łukasiewicz]] can be axiomatized as:<ref>{{Cite book|first=Merrie |last=Bergmann|title=An introduction to many-valued and fuzzy logic: semantics, algebras, and derivation systems|year=2008|publisher=Cambridge University Press|isbn=978-0-521-88128-9|page=100}}</ref>
| |
| | |
| (CA1) ⊢ ''A'' → (''B'' → ''A'')<br/>
| |
| (LA2) ⊢ (''A'' → ''B'') → ((''B'' → ''C'') → (''A'' → ''C''))<br/>
| |
| (CA3) ⊢ (¬''A'' → ¬''B'') → (''B'' → ''A'')<br/>
| |
| (LA4) ⊢ ((''A'' → ¬''A'') → ''A'') → ''A''<br/>
| |
| (MP) ''A'', ''A'' → ''B'' ⊢ ''B''
| |
| | |
| This sequence differs from classical logic by the change in axiom 2 and the addition of axiom 4. The classical deduction theorem does not hold for this logic, however a modified form does hold, namely ''A'' ⊢ ''B'' if and only if ⊢ ''A'' → (''A'' → ''B'').<ref>{{Cite book|first=Merrie |last=Bergmann|title=An introduction to many-valued and fuzzy logic: semantics, algebras, and derivation systems|year=2008|publisher=Cambridge University Press|isbn=978-0-521-88128-9|page=114}}</ref>
| |
| | |
| ==Admissibility and derivability==
| |
| {{main|Admissible rule}}
| |
| In a set of rules, an inference rule could be redundant in the sense that it is ''admissible'' or ''derivable''. A derivable rule is one whose conclusion can be derived from its premises using the other rules. An admissible rule is one whose conclusion holds whenever the premises hold. All derivable rules are admissible. To appreciate the difference, consider the following set of rules for defining the [[natural number]]s (the [[natural deduction|judgment]] <math>n\,\,\mathsf{nat}</math> asserts the fact that <math>n</math> is a natural number):
| |
| | |
| : <math>
| |
| \begin{matrix}
| |
| \frac{}{\mathbf{0} \,\,\mathsf{nat}} &
| |
| \frac{n \,\,\mathsf{nat}}{\mathbf{s(}n\mathbf{)} \,\,\mathsf{nat}} \\
| |
| \end{matrix}
| |
| </math>
| |
| | |
| The first rule states that '''0''' is a natural number, and the second states that '''s(n)''' is a natural number if ''n'' is. In this proof system, the following rule, demonstrating that the second successor of a natural number is also a natural number, is derivable:
| |
| | |
| : <math>
| |
| \frac{n \,\,\mathsf{nat}}{\mathbf{s(s(}n\mathbf{))} \,\,\mathsf{nat}}
| |
| </math>
| |
| | |
| Its derivation is the composition of two uses of the successor rule above. The following rule for asserting the existence of a predecessor for any nonzero number is merely admissible:
| |
| | |
| : <math>
| |
| \frac{\mathbf{s(}n\mathbf{)} \,\,\mathsf{nat}}{n \,\,\mathsf{nat}}
| |
| </math>
| |
| | |
| This is a true fact of natural numbers, as can be proven by [[Mathematical induction|induction]]. (To prove that this rule is admissible, assume a derivation of the premise and induct on it to produce a derivation of <math>n \,\,\mathsf{nat}</math>.) However, it is not derivable, because it depends on the structure of the derivation of the premise. Because of this, derivability is stable under additions to the proof system, whereas admissibility is not. To see the difference, suppose the following nonsense rule were added to the proof system:
| |
| | |
| : <math>
| |
| \frac{}{\mathbf{s(-3)} \,\,\mathsf{nat}}
| |
| </math>
| |
| | |
| In this new system, the double-successor rule is still derivable. However, the rule for finding the predecessor is no longer admissible, because there is no way to derive <math>\mathbf{-3} \,\,\mathsf{nat}</math>. The brittleness of admissibility comes from the way it is proved: since the proof can induct on the structure of the derivations of the premises, extensions to the system add new cases to this proof, which may no longer hold.
| |
| | |
| Admissible rules can be thought of as [[theorem]]s of a proof system. For instance, in a [[sequent calculus]] where [[cut elimination]] holds, the ''cut'' rule is admissible.
| |
| | |
| ==See also==
| |
| * [[Inference objection]]
| |
| * [[Immediate inference]]
| |
| * [[Law of thought]]
| |
| * [[List of rules of inference]]
| |
| * [[Logical truth]]
| |
| | |
| ==References==
| |
| {{reflist}}
| |
| | |
| {{logic}}
| |
| | |
| {{DEFAULTSORT:Rule Of Inference}}
| |
| [[Category:Rules of inference| ]]
| |
| [[Category:Propositional calculus]]
| |
| [[Category:Formal systems]]
| |
| [[Category:Syntax (logic)]]
| |
| [[Category:Logical truth]]
| |
| [[Category:Inference]]
| |
| [[Category:Logical expressions]]
| |