Difference between revisions of "Double negation, law of"
(Importing text file) |
(TeX) |
||
| Line 1: | Line 1: | ||
| − | A logical principle according to which "if it is untrue that A is untrue, A is true" . The law is also called the cancellation law of double negation. In a formalized logical language, the law is expressed as | + | {{TEX|done}} |
| + | A logical principle according to which "if it is untrue that A is untrue, A is true" . The law is also called the cancellation law of double negation. In a formalized logical language, the law is expressed as $\neg\neg p\supset p$ and usually appears in this form (or in the form of the corresponding [[Axiom scheme|axiom scheme]]) in the list of the logical axioms of a given formal theory. In traditional mathematics the law of double negation serves as the logical basis for the performance of so-called indirect proofs in consistent theories according to the following procedure: The assumption that the statement $A$ of a given mathematical theory is untrue leads to a contradiction in the theory; since the theory is consistent, this proves that "not A" is untrue, i.e. in accordance with the law of double negation, $A$ is true. As a rule, the law of double negation is inapplicable in constructive considerations, which involve the requirement of algorithmic effectiveness of the foundations of mathematical statements. A typical example of such a case is any indirect proof of a statement $A$ of the form "for any x there exists a y such that Bx, y is true" ; the last step, viz. the application of the law of double negation, cannot be carried out, since the constructive validity of the statement must entail the existence of an algorithm which, for any $x$, yields a construction of $y$ such that $B(x,y)$ is true. However, an argument which involves the law of double negation does not lead to the construction of any algorithm, and no such algorithm may exist (see also [[Constructive selection principle|Constructive selection principle]]). | ||
The law of double negation is closely connected with the [[Law of the excluded middle|law of the excluded middle]] and is, in a certain sense, equivalent to it. Thus, in the intuitionistic propositional calculus, each of these two laws is deducible from the other. | The law of double negation is closely connected with the [[Law of the excluded middle|law of the excluded middle]] and is, in a certain sense, equivalent to it. Thus, in the intuitionistic propositional calculus, each of these two laws is deducible from the other. | ||
Revision as of 12:44, 17 March 2014
A logical principle according to which "if it is untrue that A is untrue, A is true" . The law is also called the cancellation law of double negation. In a formalized logical language, the law is expressed as $\neg\neg p\supset p$ and usually appears in this form (or in the form of the corresponding axiom scheme) in the list of the logical axioms of a given formal theory. In traditional mathematics the law of double negation serves as the logical basis for the performance of so-called indirect proofs in consistent theories according to the following procedure: The assumption that the statement $A$ of a given mathematical theory is untrue leads to a contradiction in the theory; since the theory is consistent, this proves that "not A" is untrue, i.e. in accordance with the law of double negation, $A$ is true. As a rule, the law of double negation is inapplicable in constructive considerations, which involve the requirement of algorithmic effectiveness of the foundations of mathematical statements. A typical example of such a case is any indirect proof of a statement $A$ of the form "for any x there exists a y such that Bx, y is true" ; the last step, viz. the application of the law of double negation, cannot be carried out, since the constructive validity of the statement must entail the existence of an algorithm which, for any $x$, yields a construction of $y$ such that $B(x,y)$ is true. However, an argument which involves the law of double negation does not lead to the construction of any algorithm, and no such algorithm may exist (see also Constructive selection principle).
The law of double negation is closely connected with the law of the excluded middle and is, in a certain sense, equivalent to it. Thus, in the intuitionistic propositional calculus, each of these two laws is deducible from the other.
References
| [1] | S.C. Kleene, "Introduction to metamathematics" , North-Holland (1951) |
Comments
Indirect proofs are also called proofs by contradiction or proofs by reductio ad absurdum (cf. also Reductio ad absurdum).
Double negation, law of. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Double_negation,_law_of&oldid=18636