Supplement to Set Theory: Constructive and Intuitionistic ZF

Set-theoretic principles incompatible with intuitionistic logic

In this supplementary document we show how two well-known set-theoretic principles, foundation and choice, are incompatible with Zermelo-Fraenkel set theories based on intuitionistic logic: the assumption of either of these principles implies constructively unacceptable instances of the principle of the excluded middle (EM). (See also the discussion on these principles in the main document: Constructive and intuitionistic ZF.) We also briefly discuss another principle (linearity of ordinals) that gives rise to exlcuded middle. For the sake of readabiliy, we use lower and upper case letters to denote sets.


Foundation implies instances of EM

The axiom of foundation (or regularity) states that every inhabited (non-empty) set has an ∈-minimal element. Formally:

x[∃yx → ∃y(yx ∧ ∀z(zy → ¬(zx)))].

Here we show that constructively unacceptable instances of the excluded middle can be derived from foundation on the basis of some very elementary set-theoretic assumptions. As a consequence, foundation, as usually formulated, can not be part of a ZF set theory based on intuitionistic logic. The following argument can be carried out on the basis of a subsystem of CZF including extensionality, bounded separation, emptyset, and the axiom of pair. In such a system we can form the set {0,1} of the von Neumann natural numbers 0 and 1, where 0 is the empty set and 1 is the singleton containing the empty set only.

Let ψ be an arbitrary bounded formula and assume foundation. By bounded separation, let

A := {y ∈ {0,1}: y = 1 ∨ (y = 0 ∧ ψ)}.

We can now easily derive the excluded middle for ψ. As 1 ∈ A, the set A is inhabited. By foundation there exists a minimal element YA, that is, a YA such that for all ZY, Z does not belong to A. Since Y is an element of A, we have either Y = 1 or Y = 0 ∧ ψ.

  • If Y = 1, then 0 ∈ Y. Thus ¬(0 ∈ A) because Y is the ∈-minimal of A. Hence, by the definition of A, ¬ (0 = 0 ∧ ψ). Thus ¬ψ.
  • If instead Y = 0 ∧ ψ, then clearly ψ.

In either case, we have ψ ∨ ¬ ψ.

This argument shows that in a basic constructive set theory, we can prove excluded middle for bounded sentences if we assume foundation. In systems with full (i.e. unbounded) separation, as IZF, the same argument can be used to show that the full principle of excluded middle, EM, is derivable from foundation.

The axiom of choice implies instances of EM

Here we show that the axiom of choice (AC) implies constructively unacceptable instances of the excluded middle within a basic constructive set theory (Zermelo-Fraenkel style). Therefore we can not assume AC in any reasonable ZF set theory based on intuitionistic logic. The following argument can be carried out, for example, on the basis of a subtheory of CZF that includes extensionality, pair, union, empty set, infinity, bounded separation, replacement and bounded induction on the natural numbers. Such a system essentially coincides with Aczel and Rathjen's Elementary Constructive Set Theory, ECST, in (Aczel and Rathjen 2010). There the authors show that ECST is already sufficient to carry out a number of basic set-theoretic constructions. It is however a very weak theory, as it can not prove the existence of the addition function on the natural numbers (Rathjen 2008). Note that extensionality and separation play an essential role in the following proof.

By AC we denote the principle:

uv[(∀xu)(∃yv) ψ(x,y) → (∃f: uv)(∀xu) ψ(x,f(x))],

where “F: UV” stands for a formula expressing the fact that F is a set theoretic function with domain U and range included in V. The notions of set theoretic function, domain and range can be formalised in a standard way in constructive set theory (see, e.g., Aczel and Rathjen 2001).

Let φ be a bounded formula and define the following sets (by bounded separation):

  • A := {n ∈ {0,1} : n = 0 ∨ (n = 1 ∧ φ)},
  • B := {n ∈ {0,1} : n = 1 ∨ (n = 0 ∧ φ)}.

We note that (∀z ∈ {A,B})(∃n ∈ {0,1})(nz).

By AC, there is a choice function F: {A,B} → {0,1}, with F(A) ∈ A and F(B) ∈ B. Here we need to use a crucial fact about the natural numbers. As the values of F are natural numbers we can prove (by a bounded form of induction on the natural numbers) that either F(A) = F(B) or F(A) ≠ F(B). Now we argue as follows.

  • If F(A) = F(B), then φ, so φ∨¬φ.
  • If F(A) ≠ F(B), then we show ¬φ. Suppose for a contradiction that φ holds. Then by extensionality A = B so that F(A) = F(B), contradicting the assumption. We thus have proved that the assumption of φ yields a contradiction, so that ¬ φ. Thus φ∨¬φ.

In either case, we have proved φ∨¬φ.

Also in this case, the same argument can be used to show that EM follows from AC in a system with full separation instead of bounded separation.

We recall that even if the full axiom of choice is not compatible with constructive and intuitionistic set theories, some consequences of AC, like countable choice, can be added to constructive and intuitionistic ZF (see the main document, section on Constructive Choice Principles).

Constructive ordinals

Arguments analogous to those just presented can be used to show that standard classical properties of the ordinals, such as the linearity of their order, imply instances of EM.

There are various classically equivalent definitions of ordinal number. In a constructive context, ordinals are usually defined as hereditarily transitive sets (following Powell 1975). A set is transitive if its elements are subsets of it. That is, U is transitive if ∀XU (XU), that is, ∀XUZX (ZU). An ordinal is then defined as a transitive set all of whose elements are also transitive. The order on the ordinals is given by the membership relation. Linearity of an ordinal α is the property: ∀β ∈ α∀γ ∈ α (β ∈ γ ∨ β = γ ∨ γ ∈ β). It is an easy exercise to prove (using arguments analogous to those above) that assuming linearity for all ordinals yields instances of the excluded middle.

This example shows that in constructive set theory the notion of ordinal does not play the same central role as in classical set theory. However, ordinals supply us with a ranking of the universe and we can still define many of the familiar set-theoretic operations by transfinite recursion on ordinals (see Aczel and Rathjen 2001, Section 4.2). This is fine as long as the definitions by transfinite recursion do not make case distinctions such as in the classical ordinal cases of successor and limit.

Bibliographic information for this supplementary document is in the Bibliography for this entry.

Copyright © 2014 by
Laura Crosilla <matmlc@leeds.ac.uk>

Open access to the SEP is made possible by a world-wide funding initiative.
Please Read How You Can Help Keep the Encyclopedia Free