Constructive set theory

From Wikipedia, the free encyclopedia

Constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. That is, it uses the usual first-order language of classical set theory, and although of course the logic is constructive, there is no explicit use of constructive types. Rather, there are just sets, thus it can look very much like classical mathematics done on the most common foundations, namely the Zermelo-Fraenkel axioms (ZFC).

1 Intuitionistic Zermelo-Fraenkel
- 1.1 Predicativity
2 Myhill's constructive set theory
3 Aczel's constructive Zermelo-Fraenkel
4 Interpretability in type theory

[edit] Intuitionistic Zermelo-Fraenkel

In 1977, Harvey Friedman proposed a system of set theory based on intuitionistic logic^[1] taking the most common foundation, ZFC, and throwing away the axiom of choice (AC) and the law of the excluded middle (LEM), leaving everything else as is. However, different froms of some of the ZFC axioms which are equivalent in the classical setting are inequivalent in the constructive setting, and some forms imply LEM.

The system, which has come to be known as IZF, or Intuitionistic Zermelo-Fraenkel (ZF refers to ZFC without the axiom of choice), has the usual axioms of extensionality, pairing, union, infinity, separation and power set. The axiom schema of replacement is stated in terms of collection, and the axiom of regularity is stated in the form of an axiom schema of induction.

While the axiom of replacement requires the relation φ to be a function over the set A (that is, for every x in A there is associated exactly one y), the axiom of collection does not: it merely requires there be associated at least one y, and it asserts the existence of a set which collects at least one such y for each such x. The axiom of regularity as it is normally stated implies LEM, whereas the form of set induction does not. The formal statements of these two schemata are:

$\forall A \; ([\forall x \in A \; \exist y \; \phi(x,y)] \to \exist B \; \forall x \in A \; \exist y \in B \; \phi(x,y))$

$[\forall y \; ([\forall x \in y \; \phi(x)] \to \phi(y))] \to \forall y \; \phi(y)$

Adding LEM back to IZF recovers ZF, as LEM makes collection equivalent to replacement and set induction equivalent to regularity.

[edit] Predicativity

While IZF is based on constructive rather than classical logic, it is considered impredicative. It allows formation of sets using the axiom of separation with any proposition, including ones which contain quantifiers which are not bounded. Thus new sets can be formed in terms of the universe of all sets. Additionally the power set axiom implies the existence of a set of truth values. In the presence of LEM, this set exists and has two elements (compare Gödel universe). In the absence of it, the set of truth values is also considered impredicative.

[edit] Myhill's constructive set theory

The subject was begun by John Myhill to provide a formal foundation for Errett Bishop's program of constructive mathematics. As he presented it, Myhill's system CST is a constructive first-order logic with three sorts: natural numbers, functions, and sets. The system is:

Constructive first-order predicate logic with identity, and basic axioms related to the three sorts.
The usual Peano axioms for natural numbers.
The usual axiom of extensionality for sets, as well as one for functions, and the usual axiom of union.
A form of the axiom of infinity asserting that the collection of natural numbers (for which he introduces a constant N) is in fact a set.
Axioms asserting that the domain and range of a function are both sets. Additionally, an axiom of non-choice asserts the existence of a choice functions in case where the choice is already made. Together these acts like the usual replacement axiom in classical set theory.
The axiom of exponentation, asserting that for any two sets, there is a third set which contains all (and only) the functions whose domain is the first set, and whose range is the second set. This is a greatly weakened form of the axiom of power set in classical set theory, to which Myhill, among others, objected on the grounds of its impredicativity.
The axiom of restricted, or predicative, separation, which is a weakened form of the separation axiom in classical set theory, requiring that any quantifications be bounded to another set.
An axiom of dependent choice, which is much weaker than the usual axiom of choice.

[edit] Aczel's constructive Zermelo-Fraenkel

Peter Aczel's constructive Zermelo-Fraenkel, or CZF, is essentially IZF with its impredicative features removed. It strengthens the collection scheme, and then drops the impredicative power set axiom and replaces it with another collection scheme. Finally the separation axiom is restricted, as in Myhill's CST. This theory has a relatively simple interpretation in a form of constructive type theory and thus has modest proof theoretic strength as well as a fairly direct constructive and predicative justification, while retaining the language of set theory. Adding LEM to this theory also recovers full ZF.

The collection axioms are:

Strong collection schema: This is the constructive replacement for the axiom schema of replacement. It states that if φ is a binary relation between sets which is total over a certain domain set (that is, it has at least one image of every element in the domain), then there exists a set which contains at least one image under φ of every element of the domain, and only images of elements of the domain. Formally, for any formula φ:

$\forall a ((\forall x \in a \; \exist y \; \phi(x,y)) \to \exist b \; (\forall x \in a \; \exist y \in b \; \phi(x,y)) \wedge (\forall y \in b \; \exist x \in a \; \phi(x,y)))$

Subset collection schema: This is the constructive version of the power set axiom. Formally, for any formula φ:

$\forall a,b \; \exist u \; \forall z ((\forall x \in a \; \exist y \in b \; \phi(x,y,z)) \to \exist v \in u \; (\forall x \in a \; \exist y \in v \; \phi(x,y,z)) \wedge (\forall y \in v \; \exist x \in a \; \phi(x,y,z)))$

This is equivalent to a single and somewhat clearer axiom of fullness: between any two sets a and b, there is a set c which contains a total subrelation of any total relation between a and b that can be encoded as a set of ordered pairs. Formally:

$\forall a,b \; \exist c \subseteq P(a,b) \; \forall R \in P(a,b) \; \exist S \in c \; S \subseteq R$

where the references to P(a,b) are defined by:

$R \in P(a,b) \iff (\forall u \in R \; \exist x \in a \; \exist y \in b \; \langle x,y \rangle = u) \wedge (\forall x \in a \; \exist y \in b \; \langle x,y \rangle \in R)$

$c \subseteq P(a,b) \iff \forall R \in c \; R \in P(a,b)$

and some set-encoding of the ordered pair <x,y> is assumed.

The axiom of fullness implies CST's axiom of exponentiation: given two sets, the collection of all total functions from one to the other is also in fact a set.

The remaining axioms of CZF are: the axioms of extensionality, pairing, union, and infinity are the same as in ZF; and set induction and predicative separation are the same as above.