Universal instantiation: Difference between revisions
→top: cn; rm redundant "field" link (both redirect to first-order logic); rm nonsensical natural-language statement, for now |
redo substitution away from a, now using t ("term") everywhere |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Line 1: | Line 1: | ||
{{Short description|Rule of inference in predicate logic}} |
|||
{{Infobox mathematical statement |
{{Infobox mathematical statement |
||
| name = Universal instantiation |
| name = Universal instantiation |
||
| Line 4: | Line 5: | ||
| field = [[Predicate logic]] |
| field = [[Predicate logic]] |
||
| statement = |
| statement = |
||
| symbolic statement = <math>\forall x \, A \Rightarrow A\{x \mapsto |
| symbolic statement = <math>\forall x \, A \Rightarrow A\{x \mapsto t\}</math> |
||
}} |
}} |
||
{{Transformation rules}} |
{{Transformation rules}} |
||
In [[predicate logic]], '''universal instantiation'''<ref>{{cite book|author1=Irving M. Copi |author2=Carl Cohen |author3=Kenneth McMahon |title=Introduction to Logic | date = Nov 2010 | isbn=978-0205820375 |publisher=Pearson Education}}{{page needed|date=November 2014}}</ref><ref>Hurley, Patrick. A Concise Introduction to Logic. Wadsworth Pub Co, 2008.</ref><ref>Moore and Parker{{full citation needed|date=November 2014}}</ref> ('''UI'''; also called '''universal specification''' or '''universal elimination''',{{cn|reason=Give a reference for each synonym.}} and sometimes confused with ''[[Dictum de omni et nullo|dictum de omni]]''){{cn}} is a [[Validity (logic)|valid]] [[rule of inference]] from a truth about each member of a class of individuals to the truth about a particular individual of that class. It is generally given as a [[quantification rule]] for the [[universal quantifier]] but it can also be encoded in an [[axiom schema]]. It is one of the basic principles used in [[quantification theory]]. |
In [[predicate logic]], '''universal instantiation'''<ref>{{cite book|author1=Irving M. Copi |author2=Carl Cohen |author3=Kenneth McMahon |title=Introduction to Logic | date = Nov 2010 | isbn=978-0205820375 |publisher=Pearson Education}}{{page needed|date=November 2014}}</ref><ref>Hurley, Patrick. A Concise Introduction to Logic. Wadsworth Pub Co, 2008.</ref><ref>Moore and Parker{{full citation needed|date=November 2014}}</ref> ('''UI'''; also called '''universal specification''' or '''universal elimination''',{{cn|reason=Give a reference for each synonym.|date=June 2022}} and sometimes confused with ''[[Dictum de omni et nullo|dictum de omni]]''){{cn|date=June 2022}} is a [[Validity (logic)|valid]] [[rule of inference]] from a truth about each member of a class of individuals to the truth about a particular individual of that class. It is generally given as a [[quantification rule]] for the [[universal quantifier]] but it can also be encoded in an [[axiom schema]]. It is one of the basic principles used in [[quantification theory]]. |
||
Example: "All dogs are mammals. Fido is a dog. Therefore Fido is a mammal." |
Example: "All dogs are mammals. Fido is a dog. Therefore Fido is a mammal." |
||
Formally, the rule as an axiom schema is given as |
Formally, the rule as an axiom schema is given as |
||
: <math>\forall x \, A \Rightarrow A\{x \mapsto |
: <math>\forall x \, A \Rightarrow A\{x \mapsto t\},</math> |
||
for every formula ''A'' and every term '' |
for every formula ''A'' and every term ''t'', where <math>A\{x \mapsto t\}</math> is the result of [[substitution (logic)|substituting]] ''t'' for each ''free'' occurrence of ''x'' in ''A''. <math>\, A\{x \mapsto t\}</math> is an '''instance''' of <math>\forall x \, A.</math> |
||
And as a rule of inference it is |
And as a rule of inference it is |
||
:from <math>\vdash \forall x A</math> infer <math>\vdash A \{ x \mapsto |
:from <math>\vdash \forall x A</math> infer <math>\vdash A \{ x \mapsto t \} .</math> |
||
[[Irving Copi]] noted that universal instantiation "...[[logical consequence|follows from]] variants of rules for '[[natural deduction]]', which were devised independently by [[Gerhard Gentzen]] and [[Stanisław Jaśkowski]] in 1934."<ref>Copi, Irving M. (1979). ''Symbolic Logic'', 5th edition, Prentice Hall, Upper Saddle River, NJ</ref> |
[[Irving Copi]] noted that universal instantiation "...[[logical consequence|follows from]] variants of rules for '[[natural deduction]]', which were devised independently by [[Gerhard Gentzen]] and [[Stanisław Jaśkowski]] in 1934."<ref>Copi, Irving M. (1979). ''Symbolic Logic'', 5th edition, Prentice Hall, Upper Saddle River, NJ</ref> |
||
| Line 26: | Line 27: | ||
==See also== |
==See also== |
||
*[[Existential instantiation]] |
*[[Existential instantiation]] |
||
*[[Existential generalization]] |
|||
*[[Existential quantification]] |
*[[Existential quantification]] |
||
*[[Inference rules]] |
|||
==References== |
==References== |
||
Latest revision as of 10:12, 25 January 2024
| Type | Rule of inference |
|---|---|
| Field | Predicate logic |
| Symbolic statement |
In predicate logic, universal instantiation[1][2][3] (UI; also called universal specification or universal elimination,[citation needed] and sometimes confused with dictum de omni)[citation needed] is a valid rule of inference from a truth about each member of a class of individuals to the truth about a particular individual of that class. It is generally given as a quantification rule for the universal quantifier but it can also be encoded in an axiom schema. It is one of the basic principles used in quantification theory.
Example: "All dogs are mammals. Fido is a dog. Therefore Fido is a mammal."
Formally, the rule as an axiom schema is given as
for every formula A and every term t, where is the result of substituting t for each free occurrence of x in A. is an instance of
And as a rule of inference it is
- from infer
Irving Copi noted that universal instantiation "...follows from variants of rules for 'natural deduction', which were devised independently by Gerhard Gentzen and Stanisław Jaśkowski in 1934."[4]
Quine[edit]
According to Willard Van Orman Quine, universal instantiation and existential generalization are two aspects of a single principle, for instead of saying that "∀x x = x" implies "Socrates = Socrates", we could as well say that the denial "Socrates ≠ Socrates" implies "∃x x ≠ x". The principle embodied in these two operations is the link between quantifications and the singular statements that are related to them as instances. Yet it is a principle only by courtesy. It holds only in the case where a term names and, furthermore, occurs referentially.[5]
See also[edit]
References[edit]
- ^ Irving M. Copi; Carl Cohen; Kenneth McMahon (Nov 2010). Introduction to Logic. Pearson Education. ISBN 978-0205820375.[page needed]
- ^ Hurley, Patrick. A Concise Introduction to Logic. Wadsworth Pub Co, 2008.
- ^ Moore and Parker[full citation needed]
- ^ Copi, Irving M. (1979). Symbolic Logic, 5th edition, Prentice Hall, Upper Saddle River, NJ
- ^ Willard Van Orman Quine; Roger F. Gibson (2008). "V.24. Reference and Modality". Quintessence. Cambridge, Mass: Belknap Press of Harvard University Press. OCLC 728954096. Here: p. 366.