Math 2.0

Areas Mathematical logic Propositions, connectives and quantifiers Concept

Principle of bivalence

Builds on Proposition

Summary

The principle of bivalence says that every proposition has exactly one of two truth values: it is true or it is false, and it is not both. The two truth values are written T and F, or 11 and 00. The principle is a claim about truth values, so it belongs to the semantics of logic and is stated in the metalanguage. Classical logic rests on it: it is the reason why a truth table needs only the two values T and F for each variable.

Motivation

A truth table lists all possible cases for the parts of a compound proposition and computes the value of the whole in each case. This method needs a fixed, finite list of possible values for each part. Mathematical practice also treats each statement as settled in advance, even before a proof exists. A mathematician who works on an open problem assumes that the conjecture is true or false, and tries to find out which. The principle of bivalence states this assumption explicitly, so that it can be examined and, in some logics, dropped.

Notation

The set of truth values is {T,F}\{T, F\}, also written {1,0}\{1, 0\} or {⊤,⊥}\{\top, \bot\}; it is the Boolean domain. A valuation is a function vv from the propositional variables to {T,F}\{T, F\}, and v(φ)v(\varphi) is the truth value of a formula φ\varphi under vv. With the values 11 and 00, the connectives become arithmetic: ¬p\neg p is 1−p1 - p, p∧qp \land q is pqpq, and p∨qp \lor q is max⁡(p,q)\max(p, q).

Remarks

Examples

  1. The truth value of "267−12^{67} - 1 is prime": the proposition was false before anybody found a factor.
  2. Bivalence gives a truth table with 2n2^n rows: three variables give 2⋅2⋅2=82 \cdot 2 \cdot 2 = 8 rows.
  3. Goldbach's conjecture is true or false, although its truth value is unknown; see Goldbach's conjecture as an example of a statement.
  4. The statement "x2≥0x^2 \geq 0 for every real xx" is true, and its negation is false. Bivalence gives one of the two values, and the negation gets the other.

Non-examples

  1. Łukasiewicz's three-valued logic gives p∨¬pp \lor \neg p the value 12\tfrac{1}{2}: a third truth value is allowed, so bivalence fails.
  2. The liar sentence "this sentence is false" cannot have either value without contradiction. Some theories of truth give it a truth-value gap.
  3. In Aristotle's sea battle, the sentence "there will be a sea battle tomorrow" is, on one reading, neither true nor false today.
  4. The open sentence "x>3x > 3" is neither true nor false, but it is not a counterexample to bivalence: it is not a proposition until xx has a value.

Bivalence and the law of excluded middle

The law of excluded middle is the formula p∨¬pp \lor \neg p of the object language, or the claim that every instance of it is a tautology. Bivalence is a claim about the values that propositions can take. In classical semantics, bivalence implies the law: if pp is T, then p∨¬pp \lor \neg p is T; if pp is F, then ¬p\neg p is T, and again p∨¬pp \lor \neg p is T. The two principles are still different, and some semantics separate them. Supervaluational semantics allows propositions without a truth value, but it makes every instance of p∨¬pp \lor \neg p true. Łukasiewicz's three-valued logic rejects both: it gives p∨¬pp \lor \neg p the value 12\tfrac{1}{2} when pp has the value 12\tfrac{1}{2}.

Logics that reject bivalence

  1. Many-valued logics use three or more truth values. Łukasiewicz's and Kleene's three-valued logics add a value for "undetermined" or "undefined"; see Kleene connectives.
  2. Fuzzy logics use every real number from 00 to 11 as a truth value.
  3. Some paraconsistent logics allow a proposition to be both true and false. They reject the "not both" half of bivalence.
  4. Intuitionistic logic replaces truth by provability. It does not assert p∨¬pp \lor \neg p, but it adds no third value either: ¬¬(p∨¬p)\neg\neg(p \lor \neg p) is provable there. Gödel showed that no finite set of truth values gives exactly the intuitionistic tautologies.

Basic properties

  1. With bivalence, nn propositional variables have 2n2^n valuations, so a truth table with nn variables has 2n2^n rows.
  2. With bivalence, a connective with nn inputs is a function from {T,F}n\{T, F\}^n to {T,F}\{T, F\}, so there are 22n2^{2^n} such connectives; for n=2n = 2 there are 1616.
  3. With bivalence and the truth table of negation, every instance of p∨¬pp \lor \neg p is true, and every instance of p∧¬pp \land \neg p is false. The second fact is the law of noncontradiction.
  4. With bivalence, "pp is not true" means "pp is false". This step is the semantic basis of proof by contradiction.

History

In On Interpretation, Aristotle asked whether "there will be a sea battle tomorrow" is already true or false today. George Boole used the values 11 and 00 in his algebra of logic of 1847 and 1854. Jan Łukasiewicz built a three-valued logic in 1920 to give such statements about the future a third value. Luitzen Egbertus Jan Brouwer rejected the law of excluded middle for infinite collections, and his intuitionism led to a logic that does not rely on bivalence.

Common errors

  1. A student thinks that bivalence says we know the truth value. It says only that the value exists.
  2. A student identifies bivalence with the law of excluded middle. The first is about truth values, the second is a formula; supervaluational semantics keeps the second and drops the first.
  3. A student uses an open sentence such as "nn is even" as a counterexample to bivalence. It has no truth value because it is not a proposition; each instance "44 is even", "55 is even" has exactly one value.

Going deeper

For a student

We count the cases for the formula p∨¬pp \lor \neg p under two different assumptions on the truth values.

  1. With bivalence, pp has 22 possible values, T and F.
  2. If pp is T, then p∨¬pp \lor \neg p is T, because its first part is T.
  3. If pp is F, then ¬p\neg p is T, so p∨¬pp \lor \neg p is T.
  4. So p∨¬pp \lor \neg p is T in both rows, and it is a tautology.
  5. Now allow a third value 12\tfrac{1}{2}, with ¬x=1−x\neg x = 1 - x and x∨y=max⁡(x,y)x \lor y = \max(x, y), as in Łukasiewicz's logic.
  6. For p=12p = \tfrac{1}{2}, we get ¬p=12\neg p = \tfrac{1}{2} and p∨¬p=max⁡(12,12)=12p \lor \neg p = \max(\tfrac{1}{2}, \tfrac{1}{2}) = \tfrac{1}{2}, which is not 11.

The typical use of bivalence is silent: every truth-table proof of a law of logic uses it, because it lists only the values T and F.

A trap: steps 2 and 3 are a proof by cases on the value of pp, and the two cases are complete only because of bivalence. In a logic with a third value, a third case appears, and the conclusion can fail, as step 6 shows.

For a graduate student

Algebraically, bivalence says that the semantics of classical propositional logic is the two-element Boolean algebra. Other algebras give other semantics: a general Boolean algebra keeps all classical laws but has more than two values, and a Heyting algebra gives intuitionistic logic. This shows that the laws of classical logic do not need bivalence: they hold in every Boolean algebra, while bivalence singles out the algebra with two elements. In this sense, the law of excluded middle is a law of the logic, while bivalence is a property of a chosen semantics. In philosophy, Michael Dummett used acceptance of bivalence as the mark of realism about a subject matter, and anti-realism about mathematics fits intuitionistic logic. In model theory, every sentence is true or false in a given structure, so bivalence holds relative to a structure, while a sentence can be true in one model and false in another.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Principle of bivalence concept

Where this leads

5577 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Principle_of_bivalence, lead section
  2. Web https://en.wikipedia.org/wiki/Three-valued_logic, lead section
  3. Book isbn:9781108439534, Section 1.2
About this page
Tag5DYNDW9526
URIm2://5DYNDW9526
Kindconcept
WritingW0 stub
MSC03B05, 03B50
Part ofPropositions, connectives and quantifiers
UsesProposition
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

Used by

Instances

Non-examples