Editing Rule of inference

{{Short description|Method of deriving conclusions}}
{{good article}}
[[File:Modus ponens2.svg|thumb|upright=.8|alt=Diagram of an inference|''[[Modus ponens]]'' is one of the main rules of inference.]]

'''Rules of inference''' are ways of deriving conclusions from [[premise]]s. They are integral parts of [[formal logic]], serving as norms of the [[Logical form|logical structure]] of [[Validity (logic)|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 <math>P</math> then <math>Q</math>" and "<math>P</math>" to the conclusion "<math>Q</math>", 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. Rules of inference contrast with [[formal fallacies]]{{em dash}}invalid argument forms involving logical errors.

Rules of inference belong to [[Formal system|logical systems]], and distinct logical systems use different rules of inference. [[Propositional logic]] examines the inferential patterns of simple and compound [[proposition]]s. [[First-order logic]] extends propositional logic by articulating the internal structure of propositions. It introduces new rules of inference governing how this internal structure affects valid arguments. [[Modal logic]]s explore concepts like ''possibility'' and ''necessity'', examining the inferential structure of these concepts. [[Intuitionistic logic|Intuitionistic]], [[Paraconsistent logic|paraconsistent]], and [[many-valued logics]] propose alternative inferential patterns that differ from the traditionally dominant approach associated with [[classical logic]]. Various formalisms are used to express logical systems. Some employ many intuitive rules of inference to reflect how people [[Natural deduction|naturally reason]] while others provide minimalistic frameworks to represent foundational principles without redundancy.

Rules of inference are relevant to many areas, such as [[Mathematical proof|proofs]] in [[mathematics]] and [[automated reasoning]] in [[computer science]]. Their conceptual and psychological underpinnings are studied by [[Philosophy of logic|philosophers of logic]] and [[Cognitive psychology|cognitive psychologists]].

== Definition ==
{{Transformation rules}}
A rule of [[inference]] is a way of drawing a conclusion from a set of [[premise]]s.<ref>{{multiref | {{harvnb|Hurley|2016|p=303}} | {{harvnb|Hintikka|Sandu|2006|pp=13–14}} | {{harvnb|Carlson|2017|p=20}} | {{harvnb|Copi|Cohen|Flage|2016|pp=244–245, 447}} }}</ref> Also called ''inference rule'' and ''transformation rule'',<ref>{{multiref | {{harvnb|Shanker|2003|p=[https://books.google.com/books?id=jIzT7AT3ILIC&pg=PA442 442]}} | {{harvnb|Cook|2009|p=152}} }}</ref> it is a norm of correct inferences that can be used to guide [[logical reasoning|reasoning]], justify conclusions, and criticize [[argument]]s. As part of [[deductive logic]], rules of inference are [[argumentation scheme|argument forms]] that preserve the [[truth]] of the premises, meaning that the conclusion is always true if the premises are true.{{efn|Non-deductive arguments, by contrast, support the conclusion without ensuring that it is true, such as [[Inductive reasoning|inductive]] and [[abductive reasoning]].<ref>{{harvnb|Hintikka|Sandu|2006|pp=13–14}}</ref>}} An inference is deductively correct or [[Validity (logic)|valid]] if it follows a valid rule of inference. Whether this is the case depends only on the [[Logical form|form or syntactical structure]] of the premises and the conclusion. As a result, the actual content or concrete meaning of the statements does not affect validity. For instance, ''[[modus ponens]]'' is a rule of inference that connects two premises of the form "if <math>P</math> then <math>Q</math>" and "<math>P</math>" to the conclusion "<math>Q</math>", where <math>P</math> and <math>Q</math> stand for [[Proposition|statements]]. Any argument with this form is valid, independent of the specific meanings of <math>P</math> and <math>Q</math>, such as the argument "If it rains, then the ground is wet. It rains. Therefore, the ground is wet". In addition to ''modus ponens'', there are many other rules of inference, such as ''[[modus tollens]]'', [[disjunctive syllogism]], [[hypothetical syllogism]], [[constructive dilemma]], and [[destructive dilemma]].<ref>{{multiref | {{harvnb|Hurley|2016|pp=54–55, 283–287}} | {{harvnb|Arthur|2016|p=165}} | {{harvnb|Hintikka|Sandu|2006|pp=13–14}} | {{harvnb|Carlson|2017|p=20}} | {{harvnb|Copi|Cohen|Flage|2016|pp=244–245}} | {{harvnb|Baker|Hacker|2014|pp=[https://books.google.com/books?id=vEFVAgAAQBAJ&pg=PA88 88–90]}} }}</ref>

There are different formats to represent rules of inference. A common approach is to use a new line for each premise and separate the premises from the conclusion using a horizontal line. With this format, ''modus ponens'' is written as:<ref>{{harvnb|Hurley|2016|p=303}}</ref>{{efn|The symbol <math>\to</math> in this formula means ''if ... then ...'', expressing [[Material conditional|material implication]].<ref>{{harvnb|Magnus|Button|2021|p=32}}</ref>}}

<math>\begin{array}{l}
P \to Q \\
P \\ \hline
Q
\end{array}</math>

Some logicians employ the [[therefore sign]] (<math>\therefore</math>) together or instead of the horizontal line to indicate where the conclusion begins.<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=137, 245–246}} | {{harvnb|Magnus|Button|2021|p=109}} }}</ref> The [[sequent]] notation, a different approach, uses a single line in which the premises are separated by commas and connected to the conclusion with the [[turnstile symbol]] (<math>\vdash</math>), as in <math>P \to Q, P \vdash Q</math>.<ref>{{harvnb|Sørensen|Urzyczyn|2006|pp=[https://books.google.com/books?id=_mtnm-9KtbEC&pg=PA161 161–162]}}</ref> The letters <math>P</math> and <math>Q</math> in these formulas are so-called [[metavariable]]s: they stand for any simple or compound proposition.<ref>{{harvnb|Reynolds|1998|p=[https://books.google.com/books?id=X_ToAwAAQBAJ&pg=PA12 12]}}</ref>

Rules of inference belong to [[Formal system|logical systems]] and distinct logical systems may use different rules of inference. For example, [[universal instantiation]] is a rule of inference in the system of [[first-order logic]] but not in [[propositional logic]].<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=295–299}} | {{harvnb|Cook|2009|pp=124, 251–252}} | {{harvnb|Hurley|2016|pp=374–375}} }}</ref> Rules of inference play a central role in [[Formal proof|proofs]] as explicit procedures for arriving at a new line of a proof based on the preceding lines. Proofs involve a series of inferential steps and often use various rules of inference to establish the [[theorem]] they intend to demonstrate.<ref>{{multiref | {{harvnb|Cook|2009|pp=124, 230, 251–252}} | {{harvnb|Magnus|Button|2021|pp=112–113}} | {{harvnb|Copi|Cohen|Flage|2016|pp=244–245}} }}</ref> Rules of inference are definitory rules{{em dash}}rules about which inferences are allowed. They contrast with strategic rules, which govern the inferential steps needed to prove a certain theorem from a specific set of premises. Mastering definitory rules by itself is not sufficient for effective reasoning since they provide little guidance on how to reach the intended conclusion.<ref>{{multiref | {{harvnb|Hintikka|Sandu|2006|pp=13–14}} | {{harvnb|Hintikka|2013|p=[https://books.google.com/books?id=rUDsCAAAQBAJ&pg=PA98 98]}} }}</ref> As standards or procedures governing the transformation of symbolic expressions, rules of inference are similar to [[mathematical function]]s taking premises as input and producing a conclusion as output. According to one interpretation, rules of inference are inherent in [[logical operator]]s{{efn|Logical operators or constants are expressions used to form and connect propositions, such as ''not'', ''or'', and ''if...then...''.<ref>{{harvnb|Hurley|2016|pp=238–239}}</ref>}} found in statements, making the meaning and function of these operators explicit without adding any additional information.<ref>{{multiref | {{harvnb|Baker|Hacker|2014|pp=[https://books.google.com/books?id=vEFVAgAAQBAJ&pg=PA88 88–90]}} | {{harvnb|Tourlakis|2011|p=[https://books.google.com/books?id=8jAwgCTgnycC&pg=PA40 40]}} | {{harvnb|Hintikka|Sandu|2006|pp=13–14}} | {{harvnb|McKeon|2010|pp=[https://books.google.com/books?id=76SH_DI3yyoC&pg=PA128 128–129]}}}}</ref>

[[File:PSM V17 D740 George Boole.jpg|thumb|alt=Black-and-white drawing of a man with sideburns, dressed in a dark formal attire with a white high-collared shirt|[[George Boole]] (1815–1864) made key contributions to symbolic logic in general and propositional logic in particular.<ref>{{multiref | {{harvnb|Burris|2024|loc=Lead section}} | {{harvnb|O'Regan|2017|pp=95–96, 103}} }}</ref>]]

Logicians distinguish two types of rules of inference: rules of implication and [[rules of replacement]].{{efn|According to a narrow definition, rules of inference only encompass rules of implication but do not include rules of replacement.<ref>{{harvnb|Arthur|2016|pp=165–166}}</ref>}} Rules of implication, like ''modus ponens'', operate only in one direction, meaning that the conclusion can be deduced from the premises but the premises cannot be deduced from the conclusion. Rules of replacement, by contrast, operate in both directions, stating that two expressions are equivalent and can be freely replaced with each other. In classical logic, for example, a proposition (<math>P</math>) is equivalent to the negation{{efn|Logicians use the symbols <math>\lnot</math> or <math>\sim</math> to express negation.<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|p=446}} | {{harvnb|Magnus|Button|2021|p=32}} }}</ref>}} of its negation (<math>\lnot \lnot P</math>).{{efn|Rules of replacement are sometimes expressed using a double semi-colon. For instance, the double negation rule can be written as <math>P :: \lnot \lnot P</math>.<ref>{{harvnb|Hurley|2016|pp=323–252}}</ref>}} As a result, one can infer one from the other in either direction, making it a rule of replacement. Other rules of replacement include [[De Morgan's laws]] as well as the [[Commutative property|commutative]] and [[Associative property|associative properties]] of [[Logical conjunction|conjunction]] and [[Logical disjunction|disjunction]]. While rules of implication apply only to complete statements, rules of replacement can be applied to any part of a compound statement.<ref>{{multiref | {{harvnb|Arthur|2016|pp=165–166}} | {{harvnb|Hurley|2016|pp=302–303, 323–252}} | {{harvnb|Copi|Cohen|Flage|2016|pp=257–258}} | {{harvnb|Hurley|Watson|2018|pp=403–404, 426–428}} }}</ref>

One of the earliest discussions of formal rules of inference is found in [[Ancient history|antiquity]] in [[Aristotle's logic]]. His explanations of valid and invalid [[syllogisms]] were further refined in [[Medieval philosophy|medieval]] and [[early modern philosophy]]. The development of [[symbolic logic]] in the 19th century led to the formulation of many additional rules of inference belonging to [[Classical logic|classical]] propositional and first-order logic. In the 20th and 21st centuries, logicians developed various [[Non-classical logic|non-classical]] systems of logic with alternative rules of inference.<ref>{{multiref | {{harvnb|Hintikka|Spade|2020|loc=§ Aristotle, § Medieval Logic, § Boole and De Morgan, § Gottlob Frege}} | {{harvnb|O'Regan|2017|p=103}} | {{harvnb|Gensler|2012|p=[https://books.google.com/books?id=jpteBwAAQBAJ&pg=PA362 362]}} }}</ref>

== Basic concepts ==
Rules of inference describe the structure of arguments, which consist of premises that support a conclusion.<ref>{{multiref | {{harvnb|Hurley|2016|pp=303, 429–430}} | {{harvnb|Hintikka|Sandu|2006|pp=13–14}} | {{harvnb|Carlson|2017|p=20}} | {{harvnb|Copi|Cohen|Flage|2016|pp=244–245, 447}} }}</ref> Premises and conclusions are statements or propositions about what is true. For instance, the assertion "The door is open." is a statement that is either true or false, while the question "Is the door open?" and the command "Open the door!" are not statements and have no truth value.<ref>{{multiref | {{harvnb|Audi|1999|pp=679–681}} | {{harvnb|Lowe|2005|pp=699–701}} | {{harvnb|Dowden|2020|p=24}} | {{harvnb|Copi|Cohen|Rodych|2019|p=[https://books.google.com/books?id=38bADwAAQBAJ&pg=PA4 4]}} }}</ref> An inference is a step of reasoning from premises to a conclusion while an argument is the outward expression of an inference.<ref>{{multiref | {{harvnb|Hintikka|2019|loc=§ Nature and Varieties of Logic}} | {{harvnb|Haack|1978|pp=1–10}} | {{harvnb|Schlesinger|Keren-Portnoy|Parush|2001|p=220}} }}</ref>

[[Logic]] is the study of correct reasoning and examines how to distinguish good from bad arguments.<ref>{{multiref | {{harvnb|Hintikka|2019|loc=Lead section, § Nature and Varieties of Logic}} | {{harvnb|Audi|1999|p=679}} }}</ref> Deductive logic is the branch of logic that investigates the strongest arguments, called deductively valid arguments, for which the conclusion cannot be false if all the premises are true. This is expressed by saying that the conclusion is a [[logical consequence]] of the premises. Rules of inference belong to deductive logic and describe argument forms that fulfill this requirement.<ref>{{multiref | {{harvnb|Hintikka|Sandu|2006|pp=13–14}} | {{harvnb|Audi|1999|pp=679–681}} | {{harvnb|Cannon|2002|pp=[https://books.google.com/books?id=79qb93CQE2AC&pg=PA14 14–15]}} }}</ref> In order to precisely assess whether an argument follows a rule of inference, logicians use [[formal languages]] to express statements in a rigorous manner, similar to [[mathematical formula]]s.<ref>{{multiref | {{harvnb|Tully|2005|pp=532–533}} | {{harvnb|Hodges|2005|pp=533–536}} | {{harvnb|Walton|1996}} | {{harvnb|Johnson|1999|pp=265–268}} }}</ref> They combine formal languages with rules of inference to construct [[formal systems]]—frameworks for formulating propositions and drawing conclusions.{{efn|Additionally, formal systems may also define [[axiom]]s or [[axiom schema]]s.<ref>{{harvnb|Hodel|2013|p=[https://books.google.com/books?id=SxRYdzWio84C&pg=PA7 7]}}</ref>}} Different formal systems may employ different formal languages or different rules of inference.<ref>{{multiref | {{harvnb|Cook|2009|p=124}} | {{harvnb|Jacquette|2006|pp=2–4}} | {{harvnb|Hodel|2013|p=[https://books.google.com/books?id=SxRYdzWio84C&pg=PA7 7]}} }}</ref> The basic rules of inference within a formal system can often be expanded by introducing new rules of inference, known as ''[[admissible rule]]s''. Admissible rules do not change which arguments in a formal system are valid but can simplify proofs. If an admissible rule can be expressed through a combination of the system's basic rules, it is called a ''derived'' or ''derivable rule''.<ref>{{multiref | {{harvnb|Cook|2009|pp=9–10}} | {{harvnb|Fitting|Mendelsohn|2012|pp=[https://books.google.com/books?id=5IxqCQAAQBAJ&pg=PA68 68–69]}} | {{harvnb|Boyer|Moore|2014|pp=[https://books.google.com/books?id=eMHSBQAAQBAJ&pg=PA144 144–146]}} }}</ref> Statements that can be deduced in a formal system are called ''[[theorem]]s'' of this formal system.<ref>{{harvnb|Cook|2009|p=287}}</ref> Widely-used systems of logic include [[propositional logic]], [[first-order logic]], and [[modal logic]].<ref>{{multiref | {{harvnb|Asprino|2020|p=[https://books.google.com/books?id=H6EGEAAAQBAJ&pg=PA4 4]}} | {{harvnb|Hodges|2005|pp=533–536}} | {{harvnb|Audi|1999|pp=679–681}} }}</ref>

Rules of inference only ensure that the conclusion is true if the premises are true. An argument with false premises can still be valid, but its conclusion could be false. For example, the argument "If pigs can fly, then the sky is purple. Pigs can fly. Therefore, the sky is purple." is valid because it follows ''modus ponens'', even though it contains false premises. A valid argument is called ''[[Soundness|sound argument]]'' if all premises are true.<ref>{{multiref | {{harvnb|Copi|Cohen|Rodych|2019|p=[https://books.google.com/books?id=38bADwAAQBAJ&pg=PA30 30]}} | {{harvnb|Hurley|2016|pp=42–43, 434–435}} }}</ref>

Rules of inference are closely related to [[Tautology (logic)|tautologies]]. In logic, a tautology is a statement that is true only because of the logical vocabulary it uses, independent of the meanings of its non-logical vocabulary. For example, the statement "if the tree is green and the sky is blue then the tree is green" is true independently of the meanings of terms like ''tree'' and ''green'', making it a tautology. Every argument following a rule of inference can be transformed into a tautology. This is achieved by forming a [[Logical conjunction|conjunction]] (''and'') of all premises and connecting it through [[Material conditional|implication]] (''if ... then ...'') to the conclusion, thereby combining all the individual statements of the argument into a single statement. For example, the valid argument "The tree is green and the sky is blue. Therefore, the tree is green." can be transformed into the tautology "if the tree is green and the sky is blue then the tree is green".<ref>{{multiref | {{harvnb|Gossett|2009|pp=[https://books.google.com/books?id=NuFeW8N2hlkC&pg=PA50 50–51]}} | {{harvnb|Carlson|2017|p=20}} | {{harvnb|Hintikka|Sandu|2006|p=16}} }}</ref> Rules of inference are also closely related to [[laws of thought]], which are basic principles of logic that can take the form tautologies. For example, the [[law of identity]] asserts that each entity is [[Identity (philosophy)|identical]] to itself. Other traditional laws of thought include the [[law of non-contradiction]] and the [[law of excluded middle]].<ref>{{multiref | {{harvnb|Kirwan|2005}} | {{harvnb|Corcoran|2007|loc=[https://books.google.com/books?id=9IMEm4dYQXUC&pg=PA146 146]}} }}</ref>

Rules of inference are not the only way to demonstrate that an argument is valid. Alternative methods include the use of [[truth table]]s, which applies to propositional logic, and [[truth tree]]s, which can also be employed in first-order logic.<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=244–245, 447}} | {{harvnb|Hurley|2016|pp=267–270}} }}</ref>

== Systems of logic ==
=== Classical ===
==== Propositional logic ====
{{main|Propositional logic}}
Propositional logic examines the inferential patterns of simple and compound [[proposition]]s. It uses letters, such as <math>P</math> and <math>Q</math>, to represent simple propositions. Compound propositions are formed by modifying or combining simple propositions with [[logical operator]]s, such as <math>\lnot</math> (''not''), <math>\land</math> (''and''), <math>\lor</math> (''or''), and <math>\to</math> (''if ... then ...''). For example, if <math>P</math> stands for the statement "it is raining" and <math>Q</math> stands for the statement "the streets are wet", then <math>\lnot P</math> expresses "it is not raining" and <math>P \to Q</math> expresses "if it is raining then the streets are wet". These logical operators are [[truth-functional]], meaning that the truth value of a compound proposition depends only on the truth values of the simple propositions composing it. For instance, the compound proposition  <math>P \land Q</math> is only true if both <math>P</math> and <math>Q</math> are true; in all other cases, it is false. Propositional logic is not concerned with the concrete meaning of propositions other than their truth values.<ref>{{multiref | {{harvnb|Klement|loc=Lead section, § 1. Introduction, § 3. The Language of Propositional Logic}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA30 30–35]}} }}</ref> Key rules of inference in propositional logic are [[modus ponens]], [[modus tollens]], [[hypothetical syllogism]], [[disjunctive syllogism]], and [[double negation elimination]]. Further rules include [[conjunction introduction]], [[conjunction elimination]], [[disjunction introduction]], [[disjunction elimination]], [[constructive dilemma]], [[destructive dilemma]], [[Absorption (logic)|absorption]], and [[De Morgan's laws]].<ref>{{multiref | {{harvnb|Hurley|2016|pp=303, 315}} | {{harvnb|Copi|Cohen|Flage|2016|p=247}} | {{harvnb|Klement|loc=§ Deduction: Rules of Inference and Replacement}} }}</ref>

{|class="wikitable"
|+ Notable rules of inference<ref>{{multiref | {{harvnb|Hurley|2016|pp=303, 315}} | {{harvnb|Copi|Cohen|Flage|2016|p=247}} }}</ref>
|-
! style="text-align:center;" |Rule of inference !! style="text-align:center;" |Form !! style="text-align:center;" |Example
|-
|style="text-align:center;" |Modus ponens ||<math>\begin{array}{l}
P \to Q \\
P \\ \hline
Q
\end{array}</math> ||<math>\begin{array}{l}
\text{If Kim is in Seoul, then Kim is in South Korea.} \\
\text{Kim is in Seoul.} \\ \hline
\text{Therefore, Kim is in South Korea.}
\end{array}</math>
|-
|style="text-align:center;" |Modus tollens ||<math>\begin{array}{l}
P \to Q \\
\lnot Q \\ \hline
\lnot P
\end{array}</math> ||<math>\begin{array}{l}
\text{If Koko is a koala, then Koko is cuddly.} \\
\text{Koko is not cuddly.} \\ \hline
\text{Therefore, Koko is not a koala.}
\end{array}</math>
|-
|style="text-align:center;" |Hypothetical syllogism ||<math>\begin{array}{l}
P \to Q \\
Q \to R \\ \hline
P \to R
\end{array}</math> ||<math>\begin{array}{l}
\text{If Leo is a lion, then Leo roars.} \\
\text{If Leo roars, then Leo is fierce.} \\ \hline
\text{Therefore, if Leo is a lion, then Leo is fierce.}
\end{array}</math>
|-
|style="text-align:center;" |Disjunctive syllogism ||<math>\begin{array}{l}
P \lor Q \\
\lnot P \\ \hline
Q
\end{array}</math> ||<math>\begin{array}{l}
\text{The book is on the shelf or on the table.} \\
\text{The book is not on the shelf.} \\ \hline
\text{Therefore, the book is on the table. }
\end{array}</math>
|-
|style="text-align:center;" |Double negation elimination ||<math>\begin{array}{l}
\lnot \lnot P \\ \hline
P
\end{array}</math> ||<math>\begin{array}{l}
\text{We were not unable to meet the deadline.} \\ \hline
\text{We were able to meet the deadline. }
\end{array}</math>
|}

==== First-order logic ====
{{main|First-order logic}}
[[File:Wismar Marienkirche Bronzebüste Gottlob Frege (01-1).JPG|thumb|upright=.8|alt=Photo of a bronze bust of a bearded man|As one of the founding fathers of modern logic, [[Gottlob Frege]] (1848–1925) explored some of the foundational concepts of first-order logic.<ref>{{multiref | {{harvnb|O'Regan|2017|pp=101–103}} | {{harvnb|Zalta|2024|loc=Lead section}} }}</ref>]]

First-order logic also employs the logical operators from propositional logic but includes additional devices to articulate the internal structure of propositions. Basic propositions in first-order logic consist of a [[Predicate (logic)|predicate]], symbolized with uppercase letters like <math>P</math> and <math>Q</math>, which is applied to [[singular term]]s, symbolized with lowercase letters like <math>a</math> and <math>b</math>. For example, if <math>a</math> stands for "Aristotle" and <math>P</math> stands for "is a philosopher", the formula <math>P(a)</math> means that "Aristotle is a philosopher". Another innovation of first-order logic is the use of the [[Quantifier (logic)|quantifiers]] <math>\exists</math> and <math>\forall</math>, which express that a predicate applies to some or all individuals. For instance, the formula <math>\exists x P(x)</math> expresses that philosophers exist while <math>\forall x P(x)</math> expresses that everyone is a philosopher. The rules of inference from propositional logic are also valid in first-order logic.<ref>{{multiref | {{harvnb|Shapiro|Kouri Kissel|2024|loc=Lead section, § 2. Language}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA115 115–118]}} | {{harvnb|Cook|2009|pp=119–120}} }}</ref> Additionally, first-order logic introduces new rules of inference that govern the role of singular terms, predicates, and quantifiers in arguments. Key rules of inference are [[universal instantiation]] and [[existential generalization]]. Other rules of inference include [[universal generalization]] and [[existential instantiation]].<ref name="auto">{{multiref | {{harvnb|Hurley|2016|pp=374–377}} | {{harvnb|Shapiro|Kouri Kissel|2024|loc=§ 3. Deduction}} }}</ref>

{|class="wikitable"
|+ Notable rules of inference<ref name="auto"/>
|-
! style="text-align:center;" |Rule of inference !! style="text-align:center;" |Form !! style="text-align:center;" |Example
|-
|style="text-align:center;" |Universal instantiation ||<math>\begin{array}{l}
\forall x P(x) \\ \hline
P(a)
\end{array}</math>{{efn|This example assumes that <math>a</math> refers to an individual in the [[domain of discourse]].}} ||<math>\begin{array}{l}
\text{Everyone must pay taxes.} \\ \hline
\text{Therefore, Wesley must pay taxes.}
\end{array}</math>
|-
|style="text-align:center;" |Existential generalization ||<math>\begin{array}{l}
P(a) \\ \hline
\exists x P(x)
\end{array}</math> ||<math>\begin{array}{l}
\text{Socrates is mortal.} \\ \hline
\text{Therefore, someone is mortal.}
\end{array}</math>
|}

=== Modal logics ===
{{main|Modal logic}}
Modal logics are formal systems that extend propositional logic and first-order logic with additional logical operators. Alethic modal logic introduces the operator <math>\Diamond</math> to express that something is possible and the operator <math>\Box</math> to express that something is necessary. For example, if the <math>P</math> means that "Parvati works", then <math>\Diamond P</math> means that "It is possible that Parvati works" while <math>\Box P</math> means that "It is necessary that Parvati works". These two operators are related by a rule of replacement stating that <math>\Box P</math> is equivalent to <math>\lnot \Diamond \lnot P</math>. In other words: if something is necessarily true then it is not possible that it is not true. Further rules of inference include the necessitation rule, which asserts that a statement is necessarily true if it is provable in a formal system without any additional premises, and the distribution axiom, which allows one to derive <math>\Diamond P \to \Diamond Q </math> from <math>\Diamond (P \to Q)</math>. These rules of inference belong to system K, a weak form of modal logic with only the most basic rules of inference. Many formal systems of alethic modal logic include additional rules of inference, such as system T, which allows one to deduce <math>P</math> from <math>\Box P</math>.<ref>{{multiref | {{harvnb|Garson|2024|loc=Lead section, § 2. Modal Logics}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA171 171–176, 286–287]}} }}</ref>

Non-alethic systems of modal logic introduce operators that behave like <math>\Diamond</math> and <math>\Box</math> in alethic modal logic, following similar rules of inference but with different meanings. [[Deontic logic]] is one type of non-alethic logic. It uses the operator <math>P</math> to express that an action is permitted and the operator <math>O</math> to express that an action is required, where <math>P</math> behaves similarly to <math>\Diamond</math> and <math>O</math> behaves similarly to <math>\Box</math>. For instance, the rule of replacement in alethic modal logic asserting that <math>\Box Q</math> is equivalent to <math>\lnot \Diamond \lnot Q</math> also applies to deontic logic. As a result, one can deduce from <math>O Q</math> (e.g. Quinn has an obligation to help) that <math>\lnot P \lnot Q</math> (e.g. Quinn is not permitted not to help).<ref>{{harvnb|Garson|2024|loc=§ 3. Deontic Logics}}</ref> Other systems of modal logic include [[Temporal logic|temporal modal logic]], which has operators for what is always or sometimes the case, as well as [[Doxastic logic|doxastic]] and [[epistemic modal logic]]s, which have operators for what people believe and know.<ref>{{multiref | {{harvnb|Garson|2024|loc=§ 1. What is Modal Logic?, § 4. Temporal Logics}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA234 234–242]}} }}</ref>

=== Others ===
[[File:Aristotle Altemps Inv8575.jpg|thumb|upright=.8|alt=Photo of a marble bust of a bearded man|The rules of inference in [[Aristotle]]'s (384–322 BCE) logic have the form of syllogisms.<ref>{{harvnb|O'Regan|2017|pp=90–91, 103}}</ref>]]

Many other systems of logic have been proposed. One of the earliest systems is [[Aristotelian logic]], according to which each statement is made up of two [[Term logic|terms]], a subject and a predicate, connected by a [[Copula (linguistics)|copula]]. For example, the statement "all humans are mortal" has the subject "all humans", the predicate "mortal", and the copula "is". All rules of inference in Aristotelian logic have the form of [[syllogism]]s, which consist of two premises and a conclusion. For instance, the ''Barbara'' rule of inference describes the validity of arguments of the form "All men are mortal. All Greeks are men. Therefore, all Greeks are mortal."<ref>{{multiref | {{harvnb|Smith|2022|loc=Lead section, § 3. The Subject of Logic: “Syllogisms”}} | {{harvnb|Groarke|loc=Lead section, § 3. From Words into Propositions, § 4. Kinds of Propositions, § 9. The Syllogism}} }}</ref>

[[Second-order logic]] extends first-order logic by allowing quantifiers to apply to predicates in addition to singular terms. For example, to express that the individuals Adam (<math>a</math>) and Bianca (<math>b</math>) share a property, one can use the formula <math>\exists X (X(a) \land X(b))</math>.<ref>{{harvnb|Väänänen|2024|loc=Lead section, § 1. Introduction}}</ref> Second-order logic also comes with new rules of inference.{{efn|An important difference between first-order and second-order logic is that second-order logic is [[Completeness (logic)|incomplete]], meaning that it is not possible to provide a finite set of rules of inference with which every theorem can be deduced.<ref>{{multiref | {{harvnb|Väänänen|2024|loc=§ 1. Introduction}} | {{harvnb|Grandy|1979|p=[https://books.google.com/books?id=ItgJhsGE-RAC&pg=PA122 122]}} | {{harvnb|Linnebo|2014|p=[https://books.google.com/books?id=EKZOBAAAQBAJ&pg=PA123 123]}} }}</ref>}} For instance, one can infer <math>P(a)</math> (Adam is a philosopher) from <math>\forall X X(a)</math> (every property applies to Adam).<ref>{{harvnb|Pollard|2015|p=[https://books.google.com/books?id=6cY-CgAAQBAJ&pg=PA98 98]}}</ref>

[[Intuitionistic logic]] is a non-classical variant of propositional and first-order logic. It shares with them many rules of inference, such as ''modus ponens'', but excludes certain rules. For example, in classical logic, one can infer <math>P</math> from <math>\lnot \lnot P</math> using the rule of double negation elimination. However, in intuitionistic logic, this inference is invalid. As a result, every theorem that can be deduced in intuitionistic logic can also be deduced in classical logic, but some theorems provable in classical logic cannot be proven in intuitionistic logic.<ref>{{multiref | {{harvnb|Moschovakis|2024|loc=Lead section, § 1. Rejection of ''Tertium Non Datur''}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA110 110–114, 264–265]}} | {{harvnb|Kleene|2000|p=[https://books.google.com/books?id=q-LG8Ep7WFcC&pg=PA81 81]}} }}</ref>

[[Paraconsistent logics]] revise classical logic to allow the existence of [[Contradiction (logic)|contradictions]]. In logic, a contradiction happens if the same proposition is both affirmed and denied, meaning that a formal system contains both <math>P</math> and <math>\lnot P</math> as theorems. Classical logic prohibits contradictions because classical rules of inference lead to the [[principle of explosion]], an admissible rule of inference that makes it possible to infer <math>Q</math> from the premises <math>P</math> and <math>\lnot P</math>. Since <math>Q</math> is unrelated to <math>P</math>, any arbitrary statement can be deduced from a contradiction, making the affected systems useless for deciding what is true and false.<ref>{{multiref | {{harvnb|Shapiro|Kouri Kissel|2024|loc=§ 3. Deduction}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA102 102–104]}} | {{harvnb|Priest|Tanaka|Weber|2025|loc=Lead section}} }}</ref> Paraconsistent logics solve this problem by modifying the rules of inference in such a way that the principle of explosion is not an admissible rule of inference. As a result, it is possible to reason about inconsistent information without deriving absurd conclusions.<ref>{{multiref | {{harvnb|Weber|loc=Lead section, § 2. Logical Background}} | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA102 102–104]}} | {{harvnb|Priest|Tanaka|Weber|2025|loc=Lead section}} }}</ref>

[[Many-valued logics]] modify classical logic by introducing additional truth values. In classical logic, a proposition is either true or false with nothing in between. In many-valued logics, some propositions are neither true nor false. [[Kleene logic]], for example, is a [[three-valued logic]] that introduces the additional truth value ''undefined'' to describe situations where information is incomplete or uncertain.<ref>{{multiref | {{harvnb|Sider|2010|pp=[https://books.google.com/books?id=-KkPEAAAQBAJ&pg=PA93 93–94, 98–100]}} | {{harvnb|Gottwald|2022|loc=Lead section, § 3.4 Three-valued systems}} }}</ref> Many-valued logics have adjusted rules of inference to accommodate the additional truth values. For instance, the classical rule of replacement stating that <math>P \to Q</math> is equivalent to <math>\lnot P \lor Q</math> is invalid in many three-valued systems.<ref>{{multiref | {{harvnb|Egré|Rott|2021|loc=§ 2. Three-Valued Conditionals}} | {{harvnb|Gottwald|2022|loc=Lead section, § 2. Proof Theory}} }}</ref>

== Formalisms ==
Various formalisms or [[proof system]]s have been suggested as distinct ways of codifying reasoning and demonstrating the validity of arguments. Unlike different systems of logic, these formalisms do not impact what can be proven; they only influence how proofs are formulated. Influential frameworks include [[natural deduction]] systems, [[Hilbert systems]], and [[sequent calculi]].<ref>{{multiref | {{harvnb|Nederpelt|Geuvers|2014|pp=[https://books.google.com/books?id=orsrBQAAQBAJ&pg=PA159 159–162]}} | {{harvnb|Sørensen|Urzyczyn|2006|pp=[https://books.google.com/books?id=_mtnm-9KtbEC&pg=PA161 161–162]}} }}</ref>

Natural deduction systems aim to reflect how people naturally reason by introducing many intuitive rules of inference to make logical derivations more accessible. They break complex arguments into simple steps, often using subproofs based on temporary premises. The rules of inference in natural deduction target specific logical operators, governing how an operator can be added with introduction rules or removed with elimination rules. For example, the rule of [[conjunction introduction]] asserts that one can infer <math>P \land Q</math> from the premises <math>P</math> and <math>Q</math>, thereby producing a conclusion with the conjunction operator from premises that do not contain it. Conversely, the rule of [[conjunction elimination]] asserts that one can infer <math>P</math> from <math>P \land Q</math>, thereby producing a conclusion that no longer includes the conjunction operator. Similar rules of inference are [[disjunction introduction]] and [[Disjunction elimination|elimination]], [[implication introduction]] and [[Implication elimination|elimination]], [[negation introduction]] and [[Negation elimination|elimination]], and [[biconditional introduction]] and [[Biconditional elimination|elimination]]. As a result, systems of natural deduction usually include many rules of inference.<ref>{{multiref | {{harvnb|Pelletier|Hazen|2024|loc=Lead section, § 2.2 Modern Versions of Jaśkowski's Method, § 5.1 Normalization of Intuitionistic Logic}} | {{harvnb|Nederpelt|Geuvers|2014|pp=[https://books.google.com/books?id=orsrBQAAQBAJ&pg=PA159 159–162]}} | {{harvnb|Copi|Cohen|Flage|2016|p=244}} }}</ref>{{efn|The [[Fitch notation]] is an influential way of presenting proofs in natural deduction systems.<ref>{{harvnb|Akiba|2024|p=[https://books.google.com/books?id=ftksEQAAQBAJ&pg=PA7 7]}}</ref>}}

Hilbert systems, by contrast, aim to provide a minimal and efficient framework of logical reasoning by including as few rules of inference as possible. Many Hilbert systems only have ''modus ponens'' as the sole rule of inference. To ensure that all theorems can be deduced from this minimal foundation, they introduce [[Axiom schema|axiom schemes]].<ref>{{multiref | {{harvnb|Bacon|2023|pp=[https://books.google.com/books?id=qa3WEAAAQBAJ&pg=PA423 423–424]}} | {{harvnb|Nederpelt|Geuvers|2014|pp=[https://books.google.com/books?id=orsrBQAAQBAJ&pg=PA159 159–162]}} | {{harvnb|Sørensen|Urzyczyn|2006|pp=[https://books.google.com/books?id=_mtnm-9KtbEC&pg=PA161 161–162]}} }}</ref> An axiom scheme is a template to create axioms or true statements. It uses metavariables, which are placeholders that can be replaced by specific terms or formulas to generate an infinite number of true statements.<ref>{{multiref | {{harvnb|Reynolds|1998|p=[https://books.google.com/books?id=X_ToAwAAQBAJ&pg=PA12 12]}} | {{harvnb|Cook|2009|p=26}} }}</ref> For example, propositional logic can be defined with the following three axiom schemes: (1) <math>P \to (Q \to P)</math>, (2) <math>(P \to (Q \to R)) \to ((P \to Q) \to (P \to R))</math>, and (3) <math>(\lnot P \to \lnot Q) \to (Q \to P)</math>.<ref>{{harvnb|Smullyan|2014|pp=[https://books.google.com/books?id=n6S-AwAAQBAJ&pg=PA102 102–103]}}</ref> To formulate proofs, logicians create new statements from axiom schemes and then apply ''modus ponens'' to these statements to derive conclusions. Compared to natural deduction, this procedure tends to be less intuitive since its heavy reliance on symbolic manipulation can obscure the underlying logical reasoning.<ref>{{multiref | {{harvnb|Metcalfe|Paoli|Tsinakis|2023|pp=[https://books.google.com/books?id=CkPsEAAAQBAJ&pg=PA36 36–37]}} | {{harvnb|Nederpelt|Geuvers|2014|pp=[https://books.google.com/books?id=orsrBQAAQBAJ&pg=PA159 159–162]}} | {{harvnb|Sørensen|Urzyczyn|2006|pp=[https://books.google.com/books?id=_mtnm-9KtbEC&pg=PA161 161–162]}} }}</ref>

[[Sequent calculi]], another approach, introduce [[sequent]]s as formal representations of arguments. A sequent has the form <math>A_1 , \dots , A_m \vdash B_1, \dots , B_n</math>, where <math>A_i</math> and <math>B_i</math> stand for propositions. Sequents are conditional assertions stating that at least one <math>B_i</math> is true if all <math>A_i</math> are true. Rules of inference operate on sequents to produce additional sequents. Sequent calculi define two rules of inference for each logical operator: one to introduce it on the left side of a sequent and another to introduce it on the right side. For example, through the rule for introducing the operator <math>\lnot</math> on the left side, one can infer <math>\lnot R, P \vdash Q</math> from <math>P \vdash Q, R</math>. The [[cut rule]], an additional rule of inference, makes it possible to simplify sequents by removing certain propositions.<ref>{{multiref | {{harvnb|Rathjen|Sieg|2024|loc=§ 2.2 Sequent Calculi}} | {{harvnb|Sørensen|Urzyczyn|2006|pp=[https://books.google.com/books?id=_mtnm-9KtbEC&pg=PA161 161–165]}} }}</ref>

== Formal fallacies ==
{{main|Formal fallacy}}
While rules of inference describe valid patterns of deductive reasoning, formal fallacies are invalid argument forms that involve [[Fallacy|logical errors]]. The premises of a formal fallacy do not properly support its conclusion: the conclusion can be false even if all premises are true. Formal fallacies often mimic the structure of valid rules of inference and can thereby mislead people into unknowingly committing them and accepting their conclusions.<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=46–47, 227}} | {{harvnb|Cook|2009|p=123}} | {{harvnb|Hurley|Watson|2018|pp=125–126, 723}} }}</ref>

The formal fallacy of [[affirming the consequent]] concludes <math>P</math> from the premises <math>P \to Q</math> and <math>Q</math>, as in the argument "If Leo is a cat, then Leo is an animal. Leo is an animal. Therefore, Leo is a cat." This fallacy resembles valid inferences following ''modus ponens'', with the key difference that the fallacy swaps the second premise and the conclusion.<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=224, 439}} | {{harvnb|Hurley|Watson|2018|pp=385–386, 720}} }}</ref> The formal fallacy of [[denying the antecedent]] concludes <math>\lnot Q</math> from the premises <math>P \to Q</math> and <math>\lnot P</math>, as in the argument "If Laya saw the movie, then Laya had fun. Laya did not see the movie. Therefore, Laya did not have fun." This fallacy resembles valid inferences following ''modus tollens'', with the key difference that the fallacy swaps the second premise and the conclusion.<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=46, 228, 442}} | {{harvnb|Hurley|Watson|2018|pp=385–386, 722}} }}</ref> Other formal fallacies include [[affirming a disjunct]], the [[existential fallacy]], and the [[fallacy of the undistributed middle]].<ref>{{multiref | {{harvnb|Copi|Cohen|Flage|2016|pp=443, 449}} | {{harvnb|Hurley|Watson|2018|pp=723, 728}} | {{harvnb|Cohen|2009|p=[https://books.google.com/books?id=4aGIsKmkODgC&pg=PA254 254]}} }}</ref>

== In various fields ==
Rules of inference are relevant to many fields, especially the [[formal science]]s, such as [[mathematics]] and [[computer science]], where they are used to prove theorems.<ref>{{multiref | {{harvnb|Fetzer|1996|pp=[https://books.google.com/books?id=JbNI3b-j0mkC&pg=PA241 241–243]}} | {{harvnb|Dent|2024|p=[https://books.google.com/books?id=NbA0EQAAQBAJ&pg=PA36 36]}} }}</ref> [[Mathematical proofs]] often start with a set of axioms to describe the logical relationships between mathematical constructs. To establish theorems, mathematicians apply rules of inference to these axioms, aiming to demonstrate that the theorems are logical consequences.<ref>{{multiref | {{harvnb|Horsten|2023|loc=Lead section, § 5.4 Mathematical Proof}} | {{harvnb|Polkinghorne|2011|p=[https://books.google.com/books?id=AJV0P1pPBNoC&pg=PA65 65]}} }}</ref> [[Mathematical logic]], a subfield of mathematics and logic, uses mathematical methods and frameworks to study rules of inference and other logical concepts.<ref>{{multiref | {{harvnb|Cook|2009|pp=174, 185}} | {{harvnb|Porta|Maillet|Mas|Martinez|2011|p=[https://books.google.com/books?id=NDMID6mWcZcC&pg=PA237 237]}} }}</ref>

Computer science also relies on deductive reasoning, employing rules of inference to establish theorems and validate [[algorithms]].<ref>{{multiref | {{harvnb|Butterfield|Ngondi|2016|loc=§ Computer Science}} | {{harvnb|Cook|2009|p=174}} | {{harvnb|Dent|2024|p=[https://books.google.com/books?id=NbA0EQAAQBAJ&pg=PA36 36]}} }}</ref> [[Logic programming]] frameworks, such as [[Prolog]], allow developers to [[Knowledge representation|represent knowledge]] and use [[computation]] to draw inferences and solve problems.<ref>{{multiref | {{harvnb|Butterfield|Ngondi|2016|loc=§ Logic Programming Languages, § Prolog}} | {{harvnb|Williamson|Russo|2010|p=[https://books.google.com/books?id=SmYu9-1HGtYC&pg=PA45 45]}} }}</ref> These frameworks often include an [[automated theorem prover]], a program that uses rules of inference to generate or verify proofs automatically.<ref>{{harvnb|Butterfield|Ngondi|2016|loc=§ Theorem proving, § Mechanical Verifier}}</ref> [[Expert system]]s utilize [[automated reasoning]] to simulate the [[decision-making]] processes of human [[experts]] in specific fields, such as [[medical diagnosis]], and assist in complex problem-solving tasks. They have a [[knowledge base]] to represent the facts and rules of the field and use an [[inference engine]] to extract relevant information and respond to user queries.<ref>{{multiref | {{harvnb|Butterfield|Ngondi|2016|loc=§ Expert System, § Knowledge Base, § Inference Engine}} | {{harvnb|Fetzer|1996|pp=[https://books.google.com/books?id=JbNI3b-j0mkC&pg=PA241 241–243]}} }}</ref>

Rules of inference are central to the [[philosophy of logic]] regarding the contrast between deductive-theoretic and [[Model theory|model-theoretic]] conceptions of [[logical consequence]]. Logical consequence, a fundamental concept in logic, is the [[Relation (philosophy)|relation]] between the premises of a deductively valid argument and its conclusion. Conceptions of logical consequence explain the nature of this relation and the conditions under which it exists. The deductive-theoretic conception relies on rules of inference, arguing that logical consequence means that the conclusion can be deduced from the premises through a series of inferential steps. The model-theoretic conception, by contrast, focuses on how the non-logical vocabulary of statements can be [[Interpretation (logic)|interpreted]]. According to this view, logical consequence means that no counterexamples are possible: under no interpretation are the premises true and the conclusion false.<ref>{{multiref | {{harvnb|McKeon|loc=Lead section, § 1. Introduction, § 2b. Logical and Non-Logical Terminology}} | {{harvnb|McKeon|2010|pp=[https://books.google.com/books?id=76SH_DI3yyoC&pg=PA24 24–25, 126–128]}} | {{harvnb|Hintikka|Sandu|2006|pp=13–14, 17–18}} | {{harvnb|Beall|Restall|Sagi|2024|loc=§ 3. Mathematical Tools: Models and Proofs}} }}</ref>

[[Cognitive psychology|Cognitive psychologists]] study mental processes, including [[logical reasoning]]. They are interested in how humans use rules of inference to draw conclusions, examining the factors that influence correctness and efficiency. They observe that humans are better at using some rules of inference than others. For example, the rate of successful inferences is higher for ''modus ponens'' than for ''modus tollens''. A related topic focuses on [[Cognitive bias|biases]] that lead individuals to mistake formal fallacies for valid arguments. For instance, fallacies of the types affirming the consequent and denying the antecedent are often mistakenly accepted as valid. The assessment of arguments also depends on the concrete meaning of the propositions: individuals are more likely to accept a fallacy if its conclusion sounds plausible.<ref>{{multiref | {{harvnb|Schechter|2013|p=227}} | {{harvnb|Evans|2005|pp=171–174}} }}</ref>

==See also==
* [[Immediate inference]]
* [[Inference objection]]
* [[Law of thought]]
* [[List of rules of inference]]
* [[Logical truth]]
* [[Structural rule]]

== References ==
=== Notes ===
{{notelist}}

=== Citations ===
{{reflist}}

=== Sources ===
{{refbegin|30em}}

* {{cite book |last1=Akiba |first1=Ken |title=Indeterminacy, Vagueness, and Truth: The Boolean Many-valued Approach |publisher=Springer Nature |isbn=978-3-031-74175-3 |url=https://books.google.com/books?id=ftksEQAAQBAJ&pg=PA7 |language=en |date=2024 }}
* {{cite book |last1=Arthur |first1=Richard T. W. |title=An Introduction to Logic - Second Edition: Using Natural Deduction, Real Arguments, a Little History, and Some Humour |publisher=Broadview Press |isbn=978-1-77048-648-5 |language=en |date=2016 }}
* {{cite book |last1=Asprino |first1=L. |title=Engineering Background Knowledge for Social Robots |publisher=IOS Press |isbn=978-1-64368-109-2 |url=https://books.google.com/books?id=H6EGEAAAQBAJ&pg=PA4 |language=en |date=2020 }}
* {{cite book |last1=Audi |first1=Robert |title=The Cambridge Dictionary of Philosophy |publisher=Cambridge University Press |chapter=Philosophy of Logic |year=1999 |isbn=978-1-107-64379-6 }}
* {{cite book |last1=Bacon |first1=Andrew |title=A Philosophical Introduction to Higher-order Logics |publisher=Routledge |isbn=978-1-000-92575-3 |url=https://books.google.com/books?id=qa3WEAAAQBAJ&pg=PA423 |language=en |date=2023 }}
* {{cite book |last1=Baker |first1=Gordon P. |last2=Hacker |first2=P. M. S. |title=Wittgenstein: Rules, Grammar and Necessity: Volume 2 of an Analytical Commentary on the Philosophical Investigations, Essays and Exegesis 185-242 |publisher=John Wiley & Sons |isbn=978-1-118-85459-4 |url=https://books.google.com/books?id=vEFVAgAAQBAJ&pg=PA88 |language=en |date=2014 }}
* {{cite web |last1=Beall |first1=Jc |last2=Restall |first2=Greg |last3=Sagi |first3=Gil |title=Logical Consequence |url=https://plato.stanford.edu/entries/logical-consequence/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University  |date=2024 }}
* {{cite book |last1=Boyer |first1=Robert S. |last2=Moore |first2=J. Strother |title=A Computational Logic Handbook: Formerly Notes and Reports in Computer Science and Applied Mathematics |publisher=Academic Press |isbn=978-1-4832-7778-3 |url=https://books.google.com/books?id=eMHSBQAAQBAJ&pg=PA144 |language=en |date=2014 }}
* {{cite web |last1=Burris |first1=Stanley |title=George Boole |url=https://plato.stanford.edu/entries/boole/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=31 March 2025  |date=2024 }}
* {{cite book |last1=Butterfield |first1=Andrew |last2=Ngondi |first2=Gerard Ekembe |title=A Dictionary of Computer Science |publisher=Oxford University Press |isbn=978-0-19-968897-5 |url=https://books.google.com/books?id=GDgICwAAQBAJ&pg=PA1 |language=en  |date=2016 }}
* {{cite book |last1=Cannon |first1=Douglas |title=Deductive Logic in Natural Language |publisher=Broadview Press |isbn=978-1-77048-113-8 |url=https://books.google.com/books?id=79qb93CQE2AC&pg=PA14 |language=en |date=2002 }}
* {{cite book |last1=Carlson |first1=Robert |title=A Concrete Introduction to Real Analysis |publisher=CRC Press |isbn=978-1-4987-7815-2 |language=en |date=2017 }}
* {{cite book |last1=Cohen |first1=Elliot D. |title=Critical Thinking Unleashed |publisher=Rowman & Littlefield |isbn=978-0-7425-6432-9 |url=https://books.google.com/books?id=4aGIsKmkODgC&pg=PA254 |language=en |date=2009 }}
* {{cite book |last1=Cook |first1=Roy T. |title=Dictionary of Philosophical Logic |publisher=Edinburgh University Press |isbn=978-0-7486-3197-1 |language=en |date=2009 }}
* {{cite book |last1=Copi |first1=Irving |last2=Cohen |first2=Carl |last3=Flage |first3=Daniel |title=Essentials of Logic |publisher=Routledge |isbn=978-1-315-38900-4 |language=en |date=2016 }}
* {{cite book |last1=Copi |first1=Irving M. |last2=Cohen |first2=Carl |last3=Rodych |first3=Victor |title=Introduction to Logic |date=2019 |publisher=Routledge |isbn=978-1-351-38697-5 |language=en }}
* {{cite book |last1=Corcoran |first1=John |editor1-last=Martínez |editor1-first=Concha |editor2-last=Falguera |editor2-first=José L. |editor3-last=Sagüillo |editor3-first=José M. |title=Current Topics in Logic and Analytic Philosophy |publisher=Universidade de Santiago de Compostela |isbn=978-84-9750-811-7 |chapter-url=https://books.google.com/books?id=9IMEm4dYQXUC&pg=PA146 |language=en |chapter=Notes on the Founding of Logics and Metalogic: Aristotle, Boole, and Tarski |date=2007 |pages=143–176}}
* {{cite book |last1=Dent |first1=David |title=The Nature of Scientific Innovation, Volume I: Processes, Means and Impact |publisher=Palgrave Macmillan |isbn=978-3-031-75212-4 |url=https://books.google.com/books?id=NbA0EQAAQBAJ&pg=PA36 |language=en |date=2024 }}
*{{cite book |last1=Dowden |first1=Bradley H. |title=Logical Reasoning |date=2020 |url=https://www.csus.edu/indiv/d/dowdenb/4/logical-reasoning-archives/Logical-Reasoning-2020-05-15.pdf }} (for an earlier version, see: {{cite book |last1=Dowden |first1=Bradley Harris |title=Logical Reasoning |date=1993 |publisher=Wadsworth Publishing Company |isbn=978-0-534-17688-4 |language=en |ref=none }})
* {{cite web |last1=Egré |first1=Paul |last2=Rott |first2=Hans |title=The Logic of Conditionals |url=https://plato.stanford.edu/entries/logic-conditionals/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=24 March 2025  |date=2021 }}
* {{cite book |last1=Evans |first1=J. S. B. T. |editor1-last=Holyoak |editor1-first=Keith J. |editor2-last=Morrison |editor2-first=Robert G. |title=The Cambridge Handbook of Thinking and Reasoning |publisher=Cambridge University Press |isbn=978-0-521-82417-0 |language=en |chapter=Deductive Reasoning |date=2005 |pages=169–184}}
* {{cite book |last1=Fetzer |first1=James H. |editor1-last=Paul |editor1-first=Ellen Frankel |editor2-last=Miller |editor2-first=Fred Dycus |editor3-last=Paul |editor3-first=Jeffrey |title=Scientific Innovation, Philosophy, and Public Policy: Volume 13, Part 2 |publisher=Cambridge University Press |isbn=978-0-521-58994-9 |chapter-url=https://books.google.com/books?id=JbNI3b-j0mkC&pg=PA241 |language=en |chapter=Computer Reliability and Public Policy: Limits of Knowledge of Computer-Based Systems |date=1996 |pages=229–266}}
* {{cite book |last1=Fitting |first1=M. |last2=Mendelsohn |first2=Richard L. |title=First-Order Modal Logic |publisher=Springer Science & Business Media |isbn=978-94-011-5292-1 |url=https://books.google.com/books?id=5IxqCQAAQBAJ&pg=PA68 |language=en |date=2012 }}
* {{cite web |last1=Garson |first1=James |title=Modal Logic |url=https://plato.stanford.edu/entries/logic-modal/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=22 March 2025  |date=2024 }}
* {{cite book |last1=Gensler |first1=Harry J. |title=Introduction to Logic |publisher=Routledge |isbn=978-1-136-99453-1 |url=https://books.google.com/books?id=jpteBwAAQBAJ&pg=PA362 |language=en |date=2012 }}
* {{cite book |last1=Gossett |first1=Eric |title=Discrete Mathematics with Proof |publisher=John Wiley & Sons |isbn=978-0-470-45793-1 |url=https://books.google.com/books?id=NuFeW8N2hlkC&pg=PA50 |language=en |date=2009 }}
* {{cite web |last1=Gottwald |first1=Siegfried |title=Many-Valued Logic |url=https://plato.stanford.edu/entries/logic-manyvalued/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=24 March 2025  |date=2022 }}
* {{cite book |last1=Grandy |first1=R. E. |title=Advanced Logic for Applications |publisher=D. Reidel Publishing Company |isbn=978-90-277-1034-5 |url=https://books.google.com/books?id=ItgJhsGE-RAC&pg=PA122 |language=en |date=1979 }}
* {{cite web |last1=Groarke |first1=Louis F. |title=Aristotle: Logic |url=https://iep.utm.edu/aristotle-logic/ |website=Internet Encyclopedia of Philosophy |access-date=24 March 2025}}
* {{cite book |last1=Haack |first1=Susan |author-link=Susan Haack |title=Philosophy of Logics |date=1978 |publisher=Cambridge University Press |chapter=1. 'Philosophy of Logics' |isbn=978-0-521-29329-7 |pages=1–10 }}
* {{cite book |last1=Hintikka |first1=Jaakko |title=Inquiry as Inquiry: A Logic of Scientific Discovery |publisher=Springer Science & Business Media |isbn=978-94-015-9313-7 |url=https://books.google.com/books?id=rUDsCAAAQBAJ&pg=PA98 |language=en |date=2013 }}
* {{cite web |last1=Hintikka |first1=Jaakko J. |author-link=Jaakko Hintikka |title=Philosophy of logic |url=https://www.britannica.com/topic/philosophy-of-logic |website=Encyclopædia Britannica |access-date=21 November 2021 |language=en |archive-date=28 April 2015 |archive-url=https://web.archive.org/web/20150428101732/http://www.britannica.com/EBchecked/topic/346240/philosophy-of-logic |url-status=live |date=2019 }}
* {{cite book |last1=Hintikka |first1=Jaakko |last2=Sandu |first2=Gabriel |editor-last1=Jacquette |editor-first1=Dale |title=Philosophy of Logic |date=2006 |publisher=North Holland |chapter=What Is Logic? |isbn=978-0-444-51541-4 |pages=13–39}}
* {{cite web |last1=Hintikka |first1=Jaakko J. |last2=Spade |first2=Paul Vincent |title=History of logic: Ancient, Medieval, Modern, & Contemporary Logic |url=https://www.britannica.com/topic/history-of-logic |website=Encyclopædia Britannica |access-date=30 March 2025 |language=en  |date=2020 }}
* {{cite book |last1=Hodel |first1=Richard E. |title=An Introduction to Mathematical Logic |publisher=Dover Publications |isbn=978-0-486-49785-3 |url=https://books.google.com/books?id=SxRYdzWio84C&pg=PA7 |language=en |date=2013 }}
* {{cite book |last1=Hodges |first1=Wilfrid |editor-last1=Honderich |editor-first1=Ted |title=The Oxford Companion to Philosophy |date=2005 |publisher=Oxford University Press |chapter=Logic, Modern |isbn=978-0-19-926479-7 |pages=533–536}}
* {{cite web |last1=Horsten |first1=Leon |title=Philosophy of Mathematics |url=https://plato.stanford.edu/entries/philosophy-mathematics/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=28 March 2025  |date=2023 }}
* {{cite book |last1=Hurley |first1=Patrick J. |title=Logic: The Essentials |publisher=Cengage Learning |isbn=978-1-4737-3630-6 |language=en |date=2016 }}
* {{cite book |last1=Hurley |first1=Patrick J. |last2=Watson |first2=Lori |title=A Concise Introduction to Logic |publisher=Cengage Learning |isbn=978-1-305-95809-8 |edition=13 |date=2018 }}
* {{cite book |last1=Jacquette |first1=Dale |editor-last1=Jacquette |editor-first1=Dale |title=Philosophy of Logic |date=2006 |publisher=North Holland |chapter=Introduction: Philosophy of Logic Today |isbn=978-0-444-51541-4 |pages=1–12}}
* {{cite journal |last1=Johnson |first1=Ralph H. |title=The Relation Between Formal and Informal Logic |journal=Argumentation |year=1999 |volume=13 |issue=3 |pages=265–274 |doi=10.1023/A:1007789101256 |s2cid=141283158 }}
* {{cite book |last1=Kirwan |first1=Christopher |chapter=Laws of Thought |editor1-last=Honderich |editor1-first=Ted |title=The Oxford Companion to Philosophy |date=2005 |publisher=Oxford University Press |isbn=978-0-19-926479-7 |page=507 }}
* {{cite book |last1=Kleene |first1=S. C. |editor1-last=Beklemishev |editor1-first=Lev D. |title=The Foundations of Intuitionistic Mathematics |publisher=Elsevier |isbn=978-0-08-095759-3 |chapter-url=https://books.google.com/books?id=q-LG8Ep7WFcC&pg=PA81 |language=en |chapter=II. Various Notions of Realizability |date=2000 }}
* {{cite web |last1=Klement |first1=Kevin C. |title=Propositional Logic |url=https://iep.utm.edu/propositional-logic-sentential-logic/ |website=Internet Encyclopedia of Philosophy |access-date=24 March 2025}}
* {{cite book |last1=Linnebo |first1=Øystein |editor1-last=Horsten |editor1-first=Leon |editor2-last=Pettigrew |editor2-first=Richard |title=The Bloomsbury Companion to Philosophical Logic |publisher=Bloomsbury Publishing |isbn=978-1-4725-2829-2 |chapter-url=https://books.google.com/books?id=EKZOBAAAQBAJ&pg=PA123 |language=en |chapter=Higher-Order Logic |date=2014 |pages=105–127 }}
* {{cite book |last1=Lowe |first1=E. J. |editor-last1=Honderich |editor-first1=Ted  |title=The Oxford Companion to Philosophy |date=2005 |publisher=Oxford University Press |chapter=Philosophical Logic |isbn=978-0-19-926479-7 |pages=699–701}}
* {{cite book |last1=Magnus |first1=P. D. |last2=Button |first2=Tim |title=forall x: Calgary: An Introduction to Formal |publisher=University of Calgary |isbn=979-8-5273-4950-4 |date=2021 }}
* {{cite web |last1=McKeon |first1=Matthew |title=Logical Consequence |url=https://iep.utm.edu/logcon/ |website=Internet Encyclopedia of Philosophy |access-date=28 March 2025}}
* {{cite book |last1=McKeon |first1=Matthew W. |title=The Concept of Logical Consequence: An Introduction to Philosophical Logic |publisher=Peter Lang |isbn=978-1-4331-0645-3 |language=en |date=2010 }}
* {{cite book |last1=Metcalfe |first1=George |last2=Paoli |first2=Francesco |last3=Tsinakis |first3=Constantine |title=Residuated Structures in Algebra and Logic |publisher=American Mathematical Society |isbn=978-1-4704-6985-6 |url=https://books.google.com/books?id=CkPsEAAAQBAJ&pg=PA36 |language=en |date=2023 }}
* {{cite web |last1=Moschovakis |first1=Joan |title=Intuitionistic Logic |url=https://plato.stanford.edu/entries/logic-intuitionistic/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=23 March 2025  |date=2024 }}
* {{cite book |last1=Nederpelt |first1=Rob |last2=Geuvers |first2=Herman |title=Type Theory and Formal Proof: An Introduction |publisher=Cambridge University Press |isbn=978-1-316-06108-4 |url=https://books.google.com/books?id=orsrBQAAQBAJ&pg=PA159 |language=en |date=2014 }}
* {{cite book |last1=O'Regan |first1=Gerard |title=Concise Guide to Formal Methods: Theory, Fundamentals and Industry Applications |publisher=Springer |isbn=978-3-319-64021-1 |edition=1st 2017 |chapter=5. A Short History of Logic |date=2017 |pages=89–104}}
* {{cite web |last1=Pelletier |first1=Francis Jeffry |last2=Hazen |first2=Allen |title=Natural Deduction Systems in Logic |url=https://plato.stanford.edu/entries/natural-deduction/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=26 March 2025  |date=2024 }}
* {{cite book |last1=Polkinghorne |first1=John |title=Meaning in Mathematics |publisher=Oxford University Press |isbn=978-0-19-960505-7 |url=https://books.google.com/books?id=AJV0P1pPBNoC&pg=PA65 |language=en |date=2011 }}
* {{cite book |last1=Pollard |first1=Stephen |title=Philosophical Introduction to Set Theory |publisher=Courier Dover Publications |isbn=978-0-486-80582-5 |url=https://books.google.com/books?id=6cY-CgAAQBAJ&pg=PA98 |language=en |date=2015 }}
* {{cite book |last1=Porta |first1=Marcela |last2=Maillet |first2=Katherine |last3=Mas |first3=Marta |last4=Martinez |first4=Carmen |editor1-last=Ao |editor1-first=Sio-Iong |editor2-last=Amouzegar |editor2-first=Mahyar |editor3-last=Rieger |editor3-first=Burghard B. |title=Intelligent Automation and Systems Engineering |publisher=Springer Science & Business Media |isbn=978-1-4614-0373-9 |chapter-url=https://books.google.com/books?id=NDMID6mWcZcC&pg=PA237 |language=en |chapter=Towards a Strategy to Fight the Computer Science Declining Phenomenon |date=2011 |pages=231–242}}
* {{cite web |last1=Priest |first1=Graham |last2=Tanaka |first2=Koji |last3=Weber |first3=Zach |title=Paraconsistent Logic |url=https://plato.stanford.edu/entries/logic-paraconsistent/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=24 March 2025  |date=2025 }}
* {{cite web |last1=Rathjen |first1=Michael |last2=Sieg |first2=Wilfried |title=Proof Theory |url=https://plato.stanford.edu/entries/proof-theory/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=26 March 2025  |date=2024 }}
* {{cite book |last1=Reynolds |first1=John C. |title=Theories of Programming Languages |publisher=Cambridge University Press |isbn=978-1-139-93625-5 |url=https://books.google.com/books?id=X_ToAwAAQBAJ&pg=PA12 |language=en |date=1998 }}
* {{cite book |last1=Schechter |first1=Joshua |editor-last1=Pashler |editor-first1=Harold |title=Encyclopedia of the Mind |publisher=Sage |isbn=978-1-4129-5057-2 |language=en |chapter=Deductive Reasoning |date=2013 |pages=226–230 }}
* {{cite book |last1=Schlesinger |first1=I. M. |last2=Keren-Portnoy |first2=Tamar |last3=Parush |first3=Tamar |title=The Structure of Arguments |date=1 January 2001 |publisher=John Benjamins Publishing |isbn=978-90-272-2359-3 |language=en }}
* {{cite book |last1=Shanker |first1=Stuart |editor1-last=Shanker |editor1-first=Stuart |title=Philosophy of Science, Logic and Mathematics in the Twentieth Century |publisher=Psychology Press |isbn=978-0-415-30881-6 |chapter-url=https://books.google.com/books?id=jIzT7AT3ILIC&pg=PA442 |language=en |chapter=Glossary |date=2003 }}
* {{cite web |last1=Shapiro |first1=Stewart |last2=Kouri Kissel |first2=Teresa |title=Classical Logic |url=https://plato.stanford.edu/entries/logic-classical/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University  |date=2024 }}
* {{cite book |last1=Sider |first1=Theodore |title=Logic for Philosophy |publisher=Oxford University Press |isbn=978-0-19-957559-6 |language=en |date=2010 }}
* {{cite web |last1=Smith |first1=Robin |title=Aristotle's Logic |url=https://plato.stanford.edu/entries/aristotle-logic/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=24 March 2025  |date=2022 }}
* {{cite book |last1=Smullyan |first1=Raymond M. |title=A Beginner's Guide to Mathematical Logic |publisher=Dover Publications |isbn=978-0-486-49237-7 |url=https://books.google.com/books?id=n6S-AwAAQBAJ&pg=PA102 |language=en |date=2014 }}
* {{cite book |last1=Sørensen |first1=Morten Heine |last2=Urzyczyn |first2=Pawel |title=Lectures on the Curry-Howard Isomorphism |publisher=Elsevier |isbn=978-0-08-047892-0 |url=https://books.google.com/books?id=_mtnm-9KtbEC&pg=PA161 |language=en |date=2006 }}
* {{cite book |last1=Tourlakis |first1=George |title=Mathematical Logic |publisher=John Wiley & Sons |isbn=978-1-118-03069-1 |url=https://books.google.com/books?id=8jAwgCTgnycC&pg=PA40 |language=en |date=2011 }}
* {{cite book |last1=Tully |first1=Robert |editor-last1=Honderich |editor-first1=Ted |title=The Oxford Companion to Philosophy |date=2005 |publisher=Oxford University Press |chapter=Logic, Informal |isbn=978-0-19-926479-7 |pages=532–533}}
* {{cite web |last1=Väänänen |first1=Jouko |title=Second-order and Higher-order Logic |url=https://plato.stanford.edu/entries/logic-higher-order/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=23 March 2025  |date=2024 }}
* {{cite book |last1=Walton |first1=Douglas |editor-last1=Craig |editor-first1=Edward |title=Routledge Encyclopedia of Philosophy |date=1996 |publisher=Routledge |chapter=Formal and Informal Logic |isbn=978-0-415-07310-3 |url=https://www.rep.routledge.com/articles/thematic/formal-and-informal-logic/v-1 |doi=10.4324/9780415249126-X014-1 }}
* {{cite web |last1=Weber |first1=Zach |title=Paraconsistent Logic |url=https://iep.utm.edu/para-log/ |website=Internet Encyclopedia of Philosophy |access-date=23 March 2025}}
* {{cite book |last1=Williamson |first1=Jon |last2=Russo |first2=Federica |title=Key Terms in Logic |publisher=Continuum |isbn=978-1-84706-114-0 |url=https://books.google.com/books?id=SmYu9-1HGtYC&pg=PA45 |language=en |date=2010 }}
* {{cite web |last1=Zalta |first1=Edward N. |title=Gottlob Frege |url=https://plato.stanford.edu/entries/frege/ |website=The Stanford Encyclopedia of Philosophy |publisher=Metaphysics Research Lab, Stanford University |access-date=31 March 2025  |date=2024 }}
{{refend}}

{{Mathematical logic}}

{{DEFAULTSORT:Rule Of Inference}}
[[Category:Rules of inference| ]]