View source for Law of excluded middle

{{short description|Logic theorem}}
{{distinguish|fallacy of the excluded middle}}
{{hatnote|This article uses forms of [[Mathematical logic|logical]] notation. For a concise description of the symbols used in this notation, see [[List of logic symbols]].}}
{{use dmy dates|date=March 2024}}
In [[logic]], the '''law of excluded middle''' or the '''principle of excluded middle''' states that for every [[proposition]], [[Exclusive or|either]] this proposition or its [[negation]] is [[Truth value|true]].<ref>{{cite web |title=Laws of thought |url=https://www.britannica.com/topic/laws-of-thought#ref180926 |website=Encyclopedia Britannica |access-date=20 March 2021 |language=en}}</ref><ref>{{cite web |title=Realism – Metaphysical realism and objective truth |url=https://www.britannica.com/topic/realism-philosophy/Metaphysical-realism-and-objective-truth#ref990153 |access-date=20 March 2021 |website=Encyclopedia Britannica |language=en}}</ref> It is one of the [[Law of thought#The three traditional laws|three laws of thought]], along with the [[law of noncontradiction]], and the [[law of identity]]; however, no system of logic is built on just these laws, and none of these laws provides [[Rule of inference|inference rules]], such as [[modus ponens]] or [[De Morgan's laws]]. The law is also known as the '''law''' / '''principle''' '''of the excluded third''', in [[Latin]] '''''principium tertii exclusi'''''. Another Latin designation for this law is '''''tertium non datur''''' or "no third [possibility] is given". In [[classical logic]], the law is a [[tautology (logic)|tautology]].

In contemporary logic the principle is distinguished from the semantical [[principle of bivalence]], which states that every proposition is either true or false. The principle of bivalence always implies the law of excluded middle, while the converse is not always true. A commonly cited counterexample uses statements unprovable now, but provable in the future to show that the law of excluded middle may apply when the principle of bivalence fails.<ref>{{cite book |last1=Tomassi |first1=Paul |title=Logic |date=1999 |publisher=Routledge |isbn=978-0-415-16696-6 |page=124 |url=https://books.google.com/books?id=5Funj1Zaau0C}}</ref>

== History ==

=== Aristotle ===
The earliest known formulation is in Aristotle's discussion of the [[principle of non-contradiction]], first proposed in ''[[On Interpretation]],''<ref>P. T. Geach, The Law of Excluded Middle in ''Logic Matters,'' p. 74</ref> where he says that of two [[contradictory]] propositions (i.e. where one proposition is the negation of the other) one must be true, and the other false.<ref>''On Interpretation'', c. 9</ref> He also states it as a principle in the ''[[Metaphysics (Aristotle)|Metaphysics]]'' book 4, saying that it is necessary in every case to affirm or deny,<ref>''Metaphysics'' ''B'' 2, 996b 26–30</ref> and that it is impossible that there should be anything between the two parts of a contradiction.<ref>''Metaphysics'' Γ 7, 1011b 26–27</ref>

[[Aristotle]] wrote that ambiguity can arise from the use of ambiguous names, but cannot exist in the facts themselves:

{{Blockquote|It is impossible, then, that "being a man" should mean precisely "not being a man", if "man" not only signifies something about one subject but also has one significance. … And it will not be possible to be and not to be the same thing, except in virtue of an ambiguity, just as if one whom we call "man", and others were to call "not-man"; but the point in question is not this, whether the same thing can at the same time be and not be a man in name, but whether it can be in fact. (''Metaphysics'' 4.4, W. D. Ross (trans.), GBWW 8, 525–526).}}

Aristotle's assertion that "it will not be possible to be and not to be the same thing" would be written in propositional logic as ~(''P'' ∧ ~''P''). In modern so called classical logic, this statement is equivalent to the law of excluded middle (''P'' ∨ ~''P''), through distribution of the negation in Aristotle's assertion. The former claims that no statement is ''both'' true and false, while the latter requires that any statement is ''either'' true or false.

But Aristotle also writes, "since it is impossible that contradictories should be at the same time true of the same thing, obviously contraries also cannot belong at the same time to the same thing" (Book IV, CH 6, p.&nbsp;531). He then proposes that "there cannot be an intermediate between contradictories, but of one subject we must either affirm or deny any one predicate" (Book IV, CH 7, p.&nbsp;531). In the context of Aristotle's [[traditional logic]], this is a remarkably precise statement of the law of excluded middle, ''P'' ∨ ~''P''.

Yet in ''On Interpretation'' Aristotle seems to deny the law of excluded middle in the case of [[Problem of future contingents|future contingents]], in his discussion on the sea battle.

=== Leibniz ===

{{quote|Its usual form, "Every judgment is either true or false" [footnote 9] …"(from Kolmogorov in van Heijenoort, p. 421) footnote 9: "This is [[Gottfried Wilhelm Leibniz|Leibniz]]'s very simple formulation (see ''[[New Essays on Human Understanding|Nouveaux Essais]]'', IV,2)" (ibid p 421)}}

=== Bertrand Russell and ''Principia Mathematica'' ===
The principle was stated as a [[theorem]] of [[propositional logic]] by [[Bertrand Russell|Russell]] and [[Alfred North Whitehead|Whitehead]] in ''[[Principia Mathematica]]'' as:

<math>\mathbf{*2\cdot11}. \ \  \vdash . \ p \ \vee \thicksim p</math>.<ref>{{citation|author=[[Alfred North Whitehead]], [[Bertrand Russell]]|title=Principia Mathematica|publisher=[[Cambridge]]|year=1910|pages=105 |url=http://name.umdl.umich.edu/aat3201.0001.001}}</ref>

So just what is "truth" and "falsehood"? At the opening ''PM'' quickly announces some definitions:

{{quote|''Truth-values''. The "truth-value" of a proposition is ''truth'' if it is true and ''falsehood'' if it is false* [*This phrase is due to Frege] … the truth-value of "p ∨ q" is truth if the truth-value of either p or q is truth, and is falsehood otherwise … that of "~ p" is the opposite of that of p …" (pp. 7–8)}}

This is not much help. But later, in a much deeper discussion ("Definition and systematic ambiguity of Truth and Falsehood" Chapter II part III, p.&nbsp;41 ff), ''PM'' defines truth and falsehood in terms of a relationship between the "a" and the "b" and the "percipient". For example "This 'a' is 'b{{'"}} (e.g. "This 'object a' is 'red{{'"}}) really means {{"'}}object a' is a sense-datum" and {{"'}}red' is a sense-datum", and they "stand in relation" to one another and in relation to "I". Thus what we really mean is: "I perceive that 'This object a is red{{'"}} and this is an undeniable-by-3rd-party "truth".

''PM'' further defines a distinction between a "sense-datum" and a "sensation":
{{quote|That is, when we judge (say) "this is red", what occurs is a relation of three terms, the mind, and "this", and "red". On the other hand, when we perceive "the redness of this", there is a relation of two terms, namely the mind and the complex object "the redness of this" (pp. 43–44).}}

Russell reiterated his distinction between "sense-datum" and "sensation" in his book ''The Problems of Philosophy'' (1912), published at the same time as ''PM'' (1910–1913):
{{quote|Let us give the name of "sense-data" to the things that are immediately known in sensation: such things as colours, sounds, smells, hardnesses, roughnesses, and so on. We shall give the name "sensation" to the experience of being immediately aware of these things … The colour itself is a sense-datum, not a sensation. (p. 12)}}

Russell further described his reasoning behind his definitions of "truth" and "falsehood" in the same book (Chapter XII, ''Truth and Falsehood'').

==== Consequences of the law of excluded middle in ''Principia Mathematica'' ====
From the law of excluded middle, formula ✸2.1 in ''[[Principia Mathematica]],'' Whitehead and Russell derive some of the most powerful tools in the logician's argumentation toolkit. (In ''Principia Mathematica,'' formulas and propositions are identified by a leading asterisk and two numbers, such as "✸2.1".)

✸2.1 ~''p'' ∨ ''p'' "This is the Law of excluded middle" (''PM'', p.&nbsp;101).

The proof of ✸2.1 is roughly as follows: "primitive idea" 1.08 defines ''p'' → ''q'' = ~''p'' ∨ ''q''. Substituting ''p'' for ''q'' in this rule yields ''p'' → ''p'' = ~''p'' ∨ ''p''. Since ''p'' → ''p'' is true (this is Theorem 2.08, which is proved separately), then ~''p'' ∨ ''p'' must be true.

✸2.11 ''p'' ∨ ~''p'' (Permutation of the assertions is allowed by axiom 1.4)<br />
✸2.12 ''p'' → ~(~''p'') (Principle of double negation, part 1: if "this rose is red" is true then it's not true that {{"'}}this rose is not-red' is true".)<br />
✸2.13 ''p'' ∨ ~{~(~''p'')} (Lemma together with 2.12 used to derive 2.14)<br />
✸2.14 ~(~''p'') → ''p'' (Principle of double negation, part 2)<br />
✸2.15 (~''p'' → ''q'') → (~''q'' → ''p'') (One of the four "Principles of transposition". Similar to 1.03, 1.16 and 1.17. A very long demonstration was required here.)<br />
✸2.16 (''p'' → ''q'') → (~''q'' → ~''p'') (If it's true that "If this rose is red then this pig flies" then it's true that "If this pig doesn't fly then this rose isn't red.")<br />
✸2.17 ( ~''p'' → ~''q'' ) → (''q'' → ''p'') (Another of the "Principles of transposition".)<br />
✸2.18 (~''p'' → ''p'') → ''p'' (Called "The complement of ''reductio ad absurdum''. It states that a proposition which [[Logical consequence|follows from]] the hypothesis of its own falsehood is true" (''PM'', pp.&nbsp;103–104).)

Most of these theorems—in particular ✸2.1, ✸2.11, and ✸2.14—are rejected by intuitionism. These tools are recast into another form that Kolmogorov cites as "Hilbert's four axioms of implication" and "Hilbert's two axioms of negation" (Kolmogorov in van Heijenoort, p.&nbsp;335).

Propositions ✸2.12 and ✸2.14, "double negation":
The [[Intuitionism|intuitionist]] writings of [[L. E. J. Brouwer]] refer to what he calls "the ''principle of the reciprocity of the multiple species'', that is, the principle that for every system the correctness of a property follows from the impossibility of the impossibility of this property" (Brouwer, ibid, p.&nbsp;335).

This principle is commonly called "the principle of double negation" (''PM'', pp.&nbsp;101–102). From the law of excluded middle (✸2.1 and ✸2.11), ''PM'' derives principle ✸2.12 immediately. We substitute ~''p'' for ''p'' in 2.11 to yield ~''p'' ∨ ~(~''p''), and by the definition of implication (i.e. 1.01 p → q = ~p ∨ q) then ~p ∨ ~(~p)= p → ~(~p). QED (The derivation of 2.14 is a bit more involved.)

===Reichenbach===
It is correct, at least for bivalent logic—i.e. it can be seen with a [[Karnaugh map]]—that this law removes "the middle" of the [[Logical disjunction|inclusive-or]] used in his law (3). And this is the point of Reichenbach's demonstration that some believe the [[Exclusive or|''exclusive''-or]] should take the place of the [[Logical disjunction|''inclusive''-or]].

About this issue (in admittedly very technical terms) Reichenbach observes:

::The tertium non datur
::29. (''x'')[''f''(''x'') ∨ ~''f''(''x'')]
::is not exhaustive in its major terms and is therefore an inflated formula. This fact may perhaps explain why some people consider it unreasonable to write (29) with the inclusive-'or', and want to have it written with the sign of the ''exclusive''-'or'

::30. (''x'')[''f''(''x'') ⊕ ~''f''(''x'')], where the symbol "⊕" signifies [[exclusive-or]]<ref>The original symbol as used by Reichenbach is an upside down V, nowadays used for AND. The AND for Reichenbach is the same as that used in Principia Mathematica – a "dot" cf p. 27 where he shows a truth table where he defines "a.b". Reichenbach defines the exclusive-or on p. 35 as "the negation of the equivalence". One sign used nowadays is a circle with a + in it, i.e. ⊕ (because in binary, a ⊕ b yields modulo-2 addition – addition without carry). Other signs are ≢ (not identical to), or ≠ (not equal to).</ref>
::in which form it would be fully exhaustive and therefore [[nomological]] in the narrower sense. (Reichenbach, p. 376)

In line (30) the "(x)" means "for all" or "for every", a form used by Russell and Reichenbach; today the symbolism is usually <math>\forall</math> ''x''. Thus an example of the expression would look like this:

* (''pig''): (''Flies''(''pig'') ⊕ ~''Flies''(''pig''))
* (For all instances of "pig" seen and unseen): ("Pig does fly" or "Pig does not fly" but not both simultaneously)

=== Formalists versus Intuitionists ===
From the late 1800s through the 1930s, a bitter, persistent debate raged between Hilbert and his followers versus [[Hermann Weyl]] and [[L. E. J. Brouwer]]. Brouwer's philosophy, called [[intuitionism]], started in earnest with [[Leopold Kronecker]] in the late 1800s.

Hilbert intensely disliked Kronecker's ideas:

{{quote|Kronecker insisted that there could be no existence without construction. For him, as for Paul Gordan [another elderly mathematician], Hilbert's proof of the finiteness of the basis of the invariant system was simply not mathematics. Hilbert, on the other hand, throughout his life was to insist that if one can prove that the attributes assigned to a concept will never lead to a contradiction, the mathematical existence of the concept is thereby established (Reid p. 34)}}

{{quote|It was his [Kronecker's] contention that nothing could be said to have mathematical existence unless it could actually be constructed with a finite number of positive integers (Reid p. 26)}}

The debate had a profound effect on Hilbert. Reid indicates that [[Hilbert's second problem]] (one of [[Hilbert's problems]] from the Second International Conference in Paris in 1900) evolved from this debate (italics in the original):

::In his second problem, [Hilbert] had asked for a ''mathematical proof'' of the consistency of the axioms of the arithmetic of real numbers.
::To show the significance of this problem, he added the following observation:
::"If contradictory attributes be assigned to a concept, I say that ''mathematically the concept does not exist''" (Reid p. 71)

Thus, Hilbert was saying: "If ''p'' and ~''p'' are both shown to be true, then ''p'' does not exist", and was thereby invoking the law of excluded middle cast into the form of the law of contradiction.

{{quote|And finally constructivists … restricted mathematics to the study of concrete operations on finite or potentially (but not actually) infinite structures; completed infinite totalities … were rejected, as were indirect proof based on the Law of Excluded Middle. Most radical among the constructivists were the intuitionists, led by the erstwhile topologist L. E. J. Brouwer (Dawson p. 49)}}

The rancorous debate continued through the early 1900s into the 1920s; in 1927 Brouwer complained about "polemicizing against it [intuitionism] in sneering tones" (Brouwer in van Heijenoort, p.&nbsp;492). But the debate was fertile: it resulted in ''[[Principia Mathematica]]'' (1910–1913), and that work gave a precise definition to the law of excluded middle, and all this provided an intellectual setting and the tools necessary for the mathematicians of the early 20th century:

{{quote|Out of the rancor, and spawned in part by it, there arose several important logical developments; Zermelo's axiomatization of set theory (1908a), that was followed two years later by the first volume of ''Principia Mathematica'', in which Russell and Whitehead showed how, via the theory of types: much of arithmetic could be developed by logicist means (Dawson p. 49)}}

Brouwer reduced the debate to the use of proofs designed from "negative" or "non-existence" versus "constructive" proof:
::According to Brouwer, a statement that an object exists having a given property means that, and is only proved, when a method is known which in principle at least will enable such an object to be found or constructed …
::Hilbert naturally disagreed.
::"pure existence proofs have been the most important landmarks in the historical development of our science," he maintained. (Reid p. 155)

::Brouwer refused to accept the logical principle of the excluded middle, His argument was the following:

::"Suppose that A is the statement "There exists a member of the set ''S'' having the property ''P''." If the set is finite, it is possible—in principle—to examine each member of ''S'' and determine whether there is a member of ''S'' with the property ''P'' or that every member of ''S'' lacks the property ''P''." For finite sets, therefore, Brouwer accepted the principle of the excluded middle as valid. He refused to accept it for infinite sets because if the set ''S'' is infinite, we cannot—even in principle—examine each member of the set. If, during the course of our examination, we find a member of the set with the property ''P'', the first alternative is substantiated; but if we never find such a member, the second alternative is still not substantiated.
::Since mathematical theorems are often proved by establishing that the negation would involve us in a contradiction, this third possibility which Brouwer suggested would throw into question many of the mathematical statements currently accepted.
::"Taking the Principle of the Excluded Middle from the mathematician," Hilbert said, "is the same as … prohibiting the boxer the use of his fists."
::"The possible loss did not seem to bother Weyl … Brouwer's program was the coming thing, he insisted to his friends in Zürich." (Reid, p. 149)

In his lecture in 1941 at Yale and the subsequent paper, [[Gödel]] proposed a solution: "that the negation of a universal proposition was to be understood as asserting the existence … of a counterexample" (Dawson, p.&nbsp;157)

Gödel's approach to the law of excluded middle was to assert that objections against "the use of 'impredicative definitions{{'"}} had "carried more weight" than "the law of excluded middle and related theorems of the propositional calculus" (Dawson p.&nbsp;156). He proposed his "system Σ … and he concluded by mentioning several applications of his interpretation. Among them were a proof of the consistency with [[intuitionistic logic]] of the principle ~ (∀A: (A ∨ ~A)) (despite the inconsistency of the assumption ∃ A: ~ (A ∨ ~A))" (Dawson, p.&nbsp;157)

The debate seemed to weaken: mathematicians, logicians and engineers continue to use the law of excluded middle (and double negation) in their daily work.

=== Intuitionist definitions of the law (principle) of excluded middle ===
The following highlights the deep mathematical and philosophic problem behind what it means to "know", and also helps elucidate what the "law" implies (i.e. what the law really means). Their difficulties with the law emerge: that they do not want to accept as true implications drawn from that which is unverifiable (untestable, unknowable) or from the impossible or the false. (All quotes are from van Heijenoort, italics added).

''Brouwer'' offers his definition of "principle of excluded middle"; we see here also the issue of "testability":

::On the basis of the testability just mentioned, there hold, for properties conceived within a specific finite main system, the "principle of excluded middle", that is, ''the principle that for every system every property is either correct [richtig] or impossible'', and in particular the principle of the reciprocity of the complementary species, that is, the principle that for every system the correctness of a property follows from the impossibility of the impossibility of this property. (335){{cn|reason=The "335" appears to be a page number? The source however is unclear.|date=January 2022}}

''Kolmogorov'''s definition cites Hilbert's two axioms of negation
<ol start="5"><li>''A'' → (~''A'' → ''B'')</li>
<li>(''A'' → ''B'') → { (~''A'' → ''B'') → ''B''}</li></ol>

::Hilbert's first axiom of negation, "anything follows from the false", made its appearance only with the rise of symbolic logic, as did the first axiom of implication … while … the axiom under consideration [axiom 5] asserts something about the consequences of something impossible: we have to accept ''B'' if the true judgment ''A'' is regarded as false …
::Hilbert's second axiom of negation expresses the principle of excluded middle. The principle is expressed here in the form in which is it used for derivations: if ''B'' follows from ''A'' as well as from ~''A'', then ''B'' is true. Its usual form, "every judgment is either true or false" is equivalent to that given above".
::From the first interpretation of negation, that is, the interdiction from regarding the judgment as true, it is impossible to obtain the certitude that the principle of excluded middle is true … Brouwer showed that in the case of such transfinite judgments the principle of excluded middle cannot be considered obvious
::footnote 9: "This is Leibniz's very simple formulation (see ''Nouveaux Essais'', IV,2). The formulation "''A'' is either ''B'' or not-''B''" has nothing to do with the logic of judgments.
::footnote 10: "Symbolically the second form is expressed thus
:''A'' ∨ ~''A''
where ∨ means "or". The equivalence of the two forms is easily proved (p.&nbsp;421)

== Examples ==
For example, if ''P'' is the proposition:

:''Socrates is mortal.''

then the law of excluded middle holds that the [[logical disjunction]]:

:''Either Socrates is mortal, or it is not the case that Socrates is mortal.''

is true by virtue of its form alone. That is, the "middle" position, that Socrates is neither mortal nor not-mortal, is excluded by logic, and therefore either the first possibility (''Socrates is mortal'') or its negation (''it is not the case that Socrates is mortal'') must be true.

An example of an argument that depends on the law of excluded middle follows.<ref>This well-known example of a non-constructive proof depending on  the law of excluded middle can be found in many places, for example: {{cite book |first=Norman |last=Megill |title=Metamath: A Computer Language for Pure Mathematics|at= footnote on p. 17 |url=http://us.metamath.org/index.html#book}} and Davis 2000:220, footnote 2.</ref> We seek to prove that

:there exist two [[irrational number]]s <math>a</math> and <math>b</math> such that <math>a^b</math> is rational.

It is known that <math>\sqrt{2}</math> is irrational (see [[Square root of 2#Proofs of irrationality|proof]]). Consider the number

:<math>\sqrt{2}^{\sqrt{2}}</math>.

Clearly (excluded middle) this number is either rational or irrational. If it is rational, the proof is complete, and
:<math>a=\sqrt{2}</math> and <math>b=\sqrt{2}</math>.

But if <math>\sqrt{2}^{\sqrt{2}}</math> is irrational, then let

:<math>a=\sqrt{2}^{\sqrt{2}}</math> and <math>b=\sqrt{2}</math>.

Then

:<math>a^b = \left(\sqrt{2}^{\sqrt{2}}\right)^{\sqrt{2}} = \sqrt{2}^{\left(\sqrt{2}\cdot\sqrt{2}\right)} = \sqrt{2}^2 = 2</math>,

and 2 is certainly rational. This concludes the proof.

In the above argument, the assertion "this number is either rational or irrational" invokes the law of excluded middle. An [[intuitionist]], for example, would not accept this argument without further support for that statement. This might come in the form of a proof that the number in question is in fact irrational (or rational, as the case may be); or a finite algorithm that could determine whether the number is rational.

=== Non-constructive proofs over the infinite ===

The above proof is an example of a ''[[non-constructive]]'' proof disallowed by intuitionists:
{{quote|The proof is non-constructive because it doesn't give specific numbers <math>a</math> and <math>b</math> that satisfy the theorem but only two separate possibilities, one of which must work. (Actually <math>a=\sqrt{2}^{\sqrt{2}}</math> is irrational but there is no known easy proof of that fact.) (Davis 2000:220)}} (Constructive proofs of the specific example above are not hard to produce; for example <math>a=\sqrt{2}</math> and <math>b=\log_2 9</math> are both easily shown to be irrational, and <math>a^b=3</math>; a proof allowed by intuitionists).

By ''non-constructive'' Davis means that "a proof that there actually are mathematic entities satisfying certain conditions would not have to provide a method to exhibit explicitly the entities in question." (p.&nbsp;85). Such proofs presume the existence of a totality that is complete, a notion disallowed by intuitionists when extended to the ''infinite''—for them the infinite can never be completed:

{{quote|In classical mathematics there occur ''non-constructive'' or ''indirect'' existence proofs, which intuitionists do not accept. For example, to prove ''there exists an n such that P''(''n''), the classical mathematician may deduce a contradiction from the assumption for all ''n'', not ''P''(''n''). Under both the classical and the intuitionistic logic, by reductio ad absurdum this gives ''not for all n, not P''(''n''). The classical logic allows this result to be transformed into ''there exists an n such that P''(''n''), but not in general the intuitionistic … the classical meaning, that somewhere in the completed infinite totality of the natural numbers there occurs an ''n'' such that ''P''(''n''), is not available to him, since he does not conceive the natural numbers as a completed totality.<ref>In a comparative analysis (pp. 43–59) of the three "-isms" (and their foremost spokesmen)—Logicism (Russell and Whitehead), Intuitionism (Brouwer) and Formalism (Hilbert)—Kleene turns his thorough eye toward intuitionism, its "founder" Brouwer, and the intuitionists' complaints with respect to the law of excluded middle as applied to arguments over the "completed infinite".</ref> (Kleene 1952:49–50)}}

[[David Hilbert]] and [[Luitzen E. J. Brouwer]] both give examples of the law of excluded middle extended to the infinite. Hilbert's example: "the assertion that either there are only finitely many prime numbers or there are infinitely many" (quoted in Davis 2000:97); and Brouwer's: "Every mathematical species is either finite or infinite." (Brouwer 1923 in van Heijenoort 1967:336). In general, intuitionists allow the use of the law of excluded middle when it is confined to discourse over finite collections (sets), but not when it is used in discourse over infinite sets (e.g. the natural numbers). Thus intuitionists absolutely disallow the blanket assertion: "For all propositions ''P'' concerning infinite sets ''D'': ''P'' or ~''P''" (Kleene 1952:48).<ref>For more about the conflict between the intuitionists (e.g. Brouwer) and the formalists (Hilbert) see [[Foundations of mathematics]] and [[Intuitionism]].</ref>

Putative counterexamples to the law of excluded middle include the [[liar paradox]] or [[Quine's paradox]]. Certain resolutions of these paradoxes, particularly [[Graham Priest]]'s [[dialetheism]] as formalised in LP, have the law of excluded middle as a theorem, but resolve out the Liar as both true and false. In this way, the law of excluded middle is true, but because truth itself, and therefore disjunction, is not exclusive, it says next to nothing if one of the disjuncts is paradoxical, or both true and false.

== Criticisms ==
The [[Catuṣkoṭi]] (tetralemma) is an ancient alternative to the law of excluded middle, which examines all four possible assignments of truth values to a proposition and its negation. It has been important in [[Indian logic]] and [[Buddhist logic]] as well as the ancient Greek philosophical school known as [[Pyrrhonism]].

Many modern logic systems replace the law of excluded middle with the concept of [[negation as failure]]. Instead of a proposition's being either true or false, a proposition is either true or not able to be proved true.<ref>{{cite book | last = Clark | first = Keith | title = Logic and Data Bases | publisher = [[Springer-Verlag]] | date = 1978 | pages = 293–322 (Negation as a failure) | url = http://www.doc.ic.ac.uk/~klc/NegAsFailure.pdf | doi = 10.1007/978-1-4684-3384-5_11}}</ref> These two dichotomies only differ in logical systems that are not [[Completeness (logic)|complete]]. The principle of negation as failure is used as a foundation for [[autoepistemic logic]], and is widely used in [[logic programming]]. In these systems, the programmer is free to assert the law of excluded middle as a true fact, but it is not built-in ''a priori'' into these systems.

Mathematicians such as [[Luitzen Egbertus Jan Brouwer|L.&nbsp;E.&nbsp;J. Brouwer]] and [[Arend Heyting]] have also contested the usefulness of the law of excluded middle in the context of modern mathematics.<ref>
{{cite book| url = https://books.google.com/books?id=uUC30fqhdlAC&pg=PA138| title = "Proof and Knowledge in Mathematics" by Michael Detlefsen| isbn = 9780415068055| last1 = Detlefsen| first1 = Michael| date = January 1992| publisher = Routledge}}</ref>

===In mathematical logic===

In modern [[mathematical logic]], the excluded middle has been argued to result in possible [[Self-refuting idea|self-contradiction]]. It is possible in logic to make well-constructed propositions that can be neither true nor false; a common example of this is the "[[Liar paradox|Liar's paradox]]",<ref>{{Cite web |last=Priest |first=Graham |date=2010-11-28 |title=Paradoxical Truth |url=https://archive.nytimes.com/opinionator.blogs.nytimes.com/2010/11/28/paradoxical-truth/ |access-date=2023-09-10 |website=Opinionator |language=en}}</ref> the statement "this statement is false", which is argued to itself be neither true nor false. [[Arthur Prior]] has argued that [[Liar paradox|The Paradox]] is not an example of a statement that cannot be true or false. The law of excluded middle still holds here as the negation of this statement "This statement is not false", can be assigned true. In [[set theory]], such a self-referential paradox can be constructed by examining the set "the set of all sets that do not contain themselves". This set is unambiguously defined, but leads to a [[Russell's paradox]]:<ref>Kevin C. Klement, {{cite IEP |url-id=par-russ |title=Russell's Paradox }}</ref><ref>{{cite journal |first=Graham |last=Priest |title=The Logical Paradoxes and the Law of Excluded Middle |journal=The Philosophical Quarterly |volume=33 |issue=131 |year=1983 |pages=160–165 |doi=10.2307/2218742 |jstor=2218742 }}</ref> does the set contain, as one of its elements, itself? However, in the modern [[Zermelo–Fraenkel set theory]], this type of contradiction is no longer admitted. Furthermore, paradoxes of self reference can be constructed without even invoking negation at all, as in [[Curry's paradox]].{{cn|date=February 2022}}

== Analogous laws ==
Some systems of logic have different but analogous laws. For some finite [[finite-valued logic|''n''-valued logics]], there is an analogous law called the ''law of excluded ''n''+1th''. If negation is [[cyclic negation|cyclic]] and "∨" is a "max operator", then the law can be expressed in the object language by (P ∨ ~P ∨ ~~P ∨ ... ∨ ~...~P), where "~...~" represents ''n''−1 negation signs and "∨ ... ∨" ''n''−1 disjunction signs. It is easy to check that the sentence must receive at least one of the ''n'' [[truth value]]s (and not a value that is not one of the ''n'').

Other systems reject the law entirely.{{specify|date=August 2020}}

=== Law of the weak excluded middle===

A particularly well-studied [[intermediate logic]] is given by [[De Morgan's laws|De Morgan logic]], which adds the axiom <math>\neg P \lor \neg\neg P</math> to [[intuitionistic logic]], which is sometimes called the law of the weak excluded middle.

This is equivalent to a few other statements:

* Satisfying all of [[De Morgan's laws]] including <math> \neg(P\land Q) \,\leftrightarrow\, \neg P \lor \neg Q </math>
* <math> (P \to Q) \lor (\neg P \to \neg Q)</math>
* <math>(P \to (Q \lor \neg R)) \to ((P \to Q) \lor  (P \to \neg R))</math>

== See also ==
* {{annotated link|Brouwer–Hilbert controversy}}: an account on the formalist-intuitionist divide around the Law of the excluded middle
* ''{{annotated link|Consequentia mirabilis}}''
* [[Constructive set theory]]
* {{annotated link|Diaconescu's theorem}}
* {{annotated link|Dichotomy}}
* {{annotated link|Homogeneity (linguistics)}}: cases where LEM appears to fail in natural language
* {{annotated link|Law of excluded fourth}}
* Law of excluded middle is untrue in {{annotated link|many-valued logic}} such as {{annotated link|ternary logic}} and {{annotated link|fuzzy logic}}
* {{annotated link|Laws of thought}}
* {{annotated link|Limited principle of omniscience}}
* {{annotated link|Logical graph}}: a graphical syntax for propositional logic
* {{annotated link|Logical determinism}}: the application excluded middle to {{annotated link|modal logic|modal}} propositions
* [[Constructivism (philosophy of mathematics)|Mathematical constructivism]]
* Non-affirming negation in the {{annotated link|Prasangika}} school of Buddhism, another system in which the law of excluded middle is untrue
* {{annotated link|Peirce's law}}: another way of turning intuition classical

== Footnotes ==
{{reflist}}

== References ==
* [[Thomas Aquinas|Aquinas, Thomas]], "[[Summa Theologica]]", [[Fathers of the English Dominican Province]] (trans.), [[Daniel J. Sullivan]] (ed.), vols. 19–20 in [[Robert Maynard Hutchins]] (ed.), ''[[Great Books of the Western World]]'', Encyclopædia Britannica, Inc., Chicago, Illinois, 1952. Cited as GB 19–20.
* [[Aristotle]], "[[Metaphysics (Aristotle)|Metaphysics]]", [[W.D. Ross]] (trans.), vol. 8 in [[Robert Maynard Hutchins]] (ed.), ''[[Great Books of the Western World]]'', Encyclopædia Britannica, Inc., Chicago, Illinois, 1952. Cited as GB 8. 1st published, W.D. Ross (trans.), ''The Works of Aristotle'', Oxford University Press, Oxford, UK.
* [[Martin Davis (mathematician)|Martin Davis]] 2000, ''Engines of Logic: Mathematicians and the Origin of the Computer'', W. W. Norton & Company, NewYork, New York, {{ISBN|0-393-32229-7}} pbk.
* [[John Dawson Jr.|Dawson, J.]], ''Logical Dilemmas, The Life and Work of Kurt Gödel'', A.K. Peters, Wellesley, Massachusetts, 1997.
* [[Jean van Heijenoort|van Heijenoort, J.]], ''From Frege to Gödel, A Source Book in Mathematical Logic, 1879–1931'', Harvard University Press, Cambridge, Massachusetts, 1967. Reprinted with corrections, 1977.
* Luitzen Egbertus Jan [[Brouwer]], 1923, ''On the significance of the principle of excluded middle in mathematics, especially in function theory'' [reprinted with commentary, p.&nbsp;334, van Heijenoort]
* Andrei Nikolaevich [[Kolmogorov]], 1925, ''On the principle of excluded middle'', [reprinted with commentary, p.&nbsp;414, van Heijenoort]
* Luitzen Egbertus Jan [[Brouwer]], 1927, ''On the domains of definitions of functions'',[reprinted with commentary, p.&nbsp;446, van Heijenoort] Although not directly germane, in his (1923) Brouwer uses certain words defined in this paper.
* Luitzen Egbertus Jan [[Brouwer]], 1927(2), ''Intuitionistic reflections on formalism'',[reprinted with commentary, p.&nbsp;490, van Heijenoort]
* [[Stephen C. Kleene]] 1952 original printing, 1971 6th printing with corrections, 10th printing 1991, ''Introduction to Metamathematics'', North-Holland Publishing Company, Amsterdam, New York, {{ISBN|0-7204-2103-9}}.
* [[William Kneale|Kneale, W.]] and [[Martha Kneale|Kneale, M.]], ''The Development of Logic'', Oxford University Press, Oxford, UK, 1962. Reprinted with corrections, 1975.
* [[Alfred North Whitehead]] and [[Bertrand Russell]], ''Principia Mathematica to *56'', Cambridge at the University Press 1962 (Second Edition of 1927, reprinted). Extremely difficult because of arcane symbolism, but a must-have for serious logicians.
* [[Bertrand Russell]], ''An Inquiry Into Meaning and Truth''. The William James Lectures for 1940 delivered at Harvard University.
* [[Bertrand Russell]], ''The Problems of Philosophy, With a New Introduction by John Perry'', Oxford University Press, New York, 1997 edition (first published 1912). Easy to read.
* [[Bertrand Russell]], ''The Art of Philosophizing and Other Essays'', Littlefield, Adams & Co., Totowa, New Jersey, 1974 edition (first published 1968). Includes a wonderful essay on "The Art of drawing Inferences".
* [[Hans Reichenbach]], ''Elements of Symbolic Logic'', Dover, New York, 1947, 1975.
* [[Tom M. Mitchell|Tom Mitchell]], ''Machine Learning'', WCB McGraw–Hill, 1997.
* [[Constance Reid]], ''Hilbert'', Copernicus: Springer–Verlag New York, Inc. 1996, first published 1969. Contains a wealth of biographical information, much derived from interviews.
* [[Bart Kosko]], ''Fuzzy Thinking: The New Science of Fuzzy Logic'', Hyperion, New York, 1993. Fuzzy thinking at its finest but a good introduction to the concepts.
* [[David Hume]], ''An Inquiry Concerning Human Understanding'', reprinted in Great Books of the Western World Encyclopædia Britannica, Volume 35, 1952, p.&nbsp;449 ff. This work was published by Hume in 1758 as his rewrite of his "juvenile" ''Treatise of Human Nature: Being An attempt to introduce the experimental method of Reasoning into Moral Subjects Vol. I, Of The Understanding'' first published 1739, reprinted as: David Hume, ''A Treatise of Human Nature'', Penguin Classics, 1985. Also see: [[David Applebaum]], ''The Vision of Hume'', Vega, London, 2001: a reprint of a portion of ''An Inquiry'' starts on p.&nbsp;94 ff

== External links ==
* [http://plato.stanford.edu/entries/contradiction/ "Contradiction" entry] in the [[Stanford Encyclopedia of Philosophy]]

{{Classical logic}}
{{Mathematical logic}}
{{authority control}}

[[Category:Classical logic]]
[[Category:Articles containing proofs]]
[[Category:Theorems in propositional logic]]