Constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language with "${\displaystyle =}$" and "${\displaystyle \in }$" of classical set theory is usually used, so this is not to be confused with a constructive types approach. On the other hand, some constructive theories are indeed motivated by their interpretability in type theories.

In addition to rejecting the principle of excluded middle (${\displaystyle {\mathrm {PEM} ))$), constructive set theories often require some logical quantifiers in their axioms to be bounded, motivated by results tied to impredicativity.

Introduction

Constructive outlook

Use of intuitionistic logic

The logic of the set theories discussed here is constructive in that it rejects ${\displaystyle {\mathrm {PEM} ))$, i.e. that the disjunction ${\displaystyle \phi \lor \neg \phi }$ automatically holds for all propositions. As a rule, to prove the excluded middle for a proposition ${\displaystyle P}$, i.e. to prove the particular disjunction ${\displaystyle P\lor \neg P}$, either ${\displaystyle P}$ or ${\displaystyle \neg P}$ needs to be explicitly proven. When either such proof is established, one says the proposition is decidable, and this then logically implies the disjunction holds. Similarly, a predicate ${\displaystyle Q(x)}$ on a domain ${\displaystyle X}$ is said to be decidable when the more intricate statement ${\displaystyle \forall (x\in X).{\big (}Q(x)\lor \neg Q(x){\big )))$ is provable. Non-constructive axioms may enable proofs that formally decide such ${\displaystyle P}$ (and/or ${\displaystyle Q}$) in the sense that they prove excluded middle for ${\displaystyle P}$ (resp. the statement using the quantifier above) without demonstrating the truth of any of the disjuncts, as is often the case in classical logic. In contrast, constructive theories tend to not permit many classical proofs of properties that are provenly computationally undecidable. Similarly, a counter-example existence claim ${\displaystyle \exists (x\in X).\neg R(x)}$ is generally constructively stronger than a rejection claim ${\displaystyle \neg \forall (x\in X).R(x)}$.

The intuitionistic logic underlying the set theories discussed here, unlike the more conservative minimal logic, still permits double negation elimination for individual propositions for which excluded middle holds, and in turn the theorem formulations regarding finite objects tends to not differ from their classical counterparts. Given a model of all numbers, the equivalent for predicates, namely Markov's principle, does not automatically hold, but may be considered as an additional principle.

Expressing the instance for ${\displaystyle \neg P}$ of the valid law of noncontradiction and using a valid De Morgan's law, already minimal logic does prove ${\displaystyle \neg \neg (P\lor \neg P)}$ for any given proposition ${\displaystyle P}$. So in words, intuitionistic logic still posits: It is impossible to rule out a proposition and rule out its negation both at once, and thus the rejection of any instantiated excluded middle statement for an individual proposition is inconsistent. More generally, constructive mathematical theories tend to prove classically equivalent reformulations of classical theorems. For example, in constructive analysis, one cannot prove the intermediate value theorem in its textbook formulation, but one can prove theorems with algorithmic content that, as soon as double negation elimination and its consequences are assumed legal, are at once classically equivalent to the classical statement. The difference is that the constructive proofs are harder to find.

Imposed restrictions

A restriction to the constructive reading of existence apriori leads to stricter requirements regarding which characterizations of a set ${\displaystyle f\subset X\times Y}$ involving unbounded collections constitute a (mathematical, and so always implying total) function. This is often because the predicate in a case-wise would-be definition may not be decidable. Compared to the classical counterpart, one is generally less likely to prove the existence of relations that cannot be realized. Adopting the standard definition of set equality via extentionality, the full Axiom of Choice is such a non-constructive principle that implies ${\displaystyle {\mathrm {PEM} ))$ for the formulas permitted in one's adopted Separation schema, by Diaconescu's theorem. Similar results hold for the Axiom of Regularity in its standard form, as shown below. So at the very least, the development of constructive set theory requires rejection of strong choice principles and the rewording of some standard axioms to classically equivalent ones. Undecidability of disjunctions also affects the claims about total orders such as that of all ordinal numbers, expressed by the provability and rejection of the clauses in the order defining disjunction ${\displaystyle (\alpha \in \beta )\lor (\alpha =\beta )\lor (\beta \in \alpha )}$. This determines whether the relation is trichotomous. And this in turn affects the proof theoretic strength defined in ordinal analysis.

Metalogic

As in the study of constructive arithmetic theories, constructive set theories can exhibit attractive disjunction and existence properties. These are features of a fixed theory which relate metalogical judgements and propositions provable in the theory. Particularly well-studied are those such features that can be expressed in Heyting arithmetic, with quantifiers over numbers and which can often be realized by numerals, as formalized in proof theory. In particular, those are the numerical existence property and the closely related disjunctive property, as well as being closed under Church's rule, witnessing any given function to be computable.

A set theory does not only express theorems about numbers. Furthermore, one may consider a more general strong existence property that is harder to come by, as will be discussed. The theory has the property if the following can be established: For any property ${\displaystyle \phi }$, if the theory proves that a set exist that has that property, i.e. if the theory claims the existence statement, then there is also a property ${\displaystyle \psi }$ that uniquely describes such a set instance. More formally, for any predicate ${\displaystyle \phi }$ there is a predicate ${\displaystyle \psi }$ so that

${\displaystyle {\mathsf {T))\vdash \exists x.\phi (x)\implies {\mathsf {T))\vdash \exists !x.\phi (x)\land \psi (x)}$

The analogous role of the realized numeral is played by defined sets proven to exist according to the theory, and so this is a subtle question concerning term construction and the theories strength. While many theories discussed tend have all the various numerical properties, the existence property can easily be spoiled, as will be discussed. Weaker forms of existence properties have been formulated.

Some classical theories can in fact also be constrained to exhibit the strong existence property. Zermelo–Fraenkel set theory ${\displaystyle {\mathsf {ZF))}$ with the constructible universe postulate, ${\displaystyle {\mathsf {ZF))+({\mathrm {V} }={\mathrm {L} })}$, or ${\displaystyle {\mathsf {ZF))}$ with sets all taken to be ordinal-definable, ${\displaystyle {\mathsf {ZF))+({\mathrm {V} }={\mathrm {OD} })}$, do have the existence property. For contrast, consider the theory ${\displaystyle {\mathsf {ZFC))}$ given by ${\displaystyle {\mathsf {ZF))}$ plus the full axiom of choice existence postulate. Recall that this set of axioms implies the well-ordering theorem, which in particular means that relations for ${\displaystyle {\mathbb {R} ))$ that establish its well-ordering are formally proven to exist (and claim existence of a least element for all subsets of ${\displaystyle {\mathbb {R} ))$ with respect to those relations). This is despite that fact that definability of such an ordering is known to be independent of ${\displaystyle {\mathsf {ZFC))}$. The latter implies that for no particular formula ${\displaystyle \psi }$ in the language of the theory does the theory prove that the corresponding set is a well-ordering relation of the reals. So ${\displaystyle {\mathsf {ZFC))}$ formally proves the existence of a subset ${\displaystyle x\subset {\mathbb {R} }\times {\mathbb {R} ))$ with the property of being a well-ordering relation, but at the same time no particular set ${\displaystyle x}$ for which the property could be validated can possibly be defined.

Anti-classical principles

A situation commonly studied is that of a fixed theory ${\displaystyle {\mathsf {T))}$ exhibiting the following meta-theoretical property: For an instance from some collection of formulas, here captured via ${\displaystyle \phi }$ and ${\displaystyle \psi }$, one established the existence of a numeral constant ${\displaystyle e}$ so that ${\displaystyle {\mathsf {T))\vdash \phi \implies {\mathsf {T))\vdash \psi (e)}$. When adopting such a schema as an inference rule and nothing new can be proven, one says the theory ${\displaystyle {\mathsf {T))}$ is closed under that rule. Adjoining excluded middle ${\displaystyle {\mathrm {PEM} ))$ to ${\displaystyle {\mathsf {T))}$, the new theory may then prove new, strictly classical statements for ${\displaystyle \phi }$ and this may spoil the meta-theoretical property that was previously established for ${\displaystyle {\mathsf {T))}$. One may instead consider adjoining the rule corresponding to the meta-theoretical property as an implication to ${\displaystyle {\mathsf {T))}$, as a schema or in quantified form. That is to say, to postulate that any such ${\displaystyle \phi }$ implies ${\displaystyle \exists (e\in {\mathbb {N} })}$ such that ${\displaystyle \psi (e)}$ holds, where the bound ${\displaystyle e}$ is a number variable in language of the theory. The new theory with the principle added might be anti-classical, in that it may not be consistent anymore to also adopt ${\displaystyle {\mathrm {PEM} ))$. For example, Church's rule is an admissible rule in Heyting arithmetic ${\displaystyle {\mathsf {HA))}$ and the corresponding Church's thesis principle may be adopted, but the same is not possible in ${\displaystyle {\mathsf {HA))+{\mathrm {PEM} ))$, also known as Peano arithmetic ${\displaystyle {\mathsf {PA))}$.

Now for a context of set theories with quantification over a fully formal notion of an infinite sequences space, i.e. function spaces, as will be defined below. A translation of Church's rule into the language of the theory itself may then read

${\displaystyle \forall (f\in {\mathbb {N} }^{\mathbb {N} }).\exists (e\in {\mathbb {N} }).{\Big (}\forall (n\in {\mathbb {N} }).\exists (w\in {\mathbb {N} }).T(e,n,w)\land U(w,f(n)){\Big )))$

Kleene's T predicate together with the result extraction expresses that any input number ${\displaystyle n}$ being mapped to the number ${\displaystyle f(n)}$ is, through ${\displaystyle w}$, witnessed to be a computable mapping. Here ${\displaystyle {\mathbb {N} ))$ now denotes a set theory model of the standard natural numbers and ${\displaystyle e}$ is an index with respect to a fixed program enumeration. Stronger variants have been used, which extend this principle to functions ${\displaystyle f\in {\mathbb {N} }^{X))$ defined on domains ${\displaystyle X\subset {\mathbb {N} ))$ of low complexity. The principle rejects decidability for the predicate ${\displaystyle Q(e)}$ defined as ${\displaystyle \exists (w\in {\mathbb {N} }).T(e,e,w)}$, expressing that ${\displaystyle e}$ is the index of a computable function halting on its own index. Weaker, double negated forms of the principle may be considered too, which do not require the existence of a recursive implementation for every ${\displaystyle f}$, but which still make principles inconsistent that claim the existence of functions which provenly have no recursive realization. Some forms of a Church's thesis as principle are even consistent with the weak classical second order arithmetic ${\displaystyle {\mathsf {RCA))_{0))$.

The collection of total, computable functions is classically subcountable, which classically is the same as being countable. But classical set theories will generally claim that ${\displaystyle {\mathbb {N} }^{\mathbb {N} ))$ holds also other functions than the computable ones. For example there is a proof in ${\displaystyle {\mathsf {ZF))}$ that total functions do exist that cannot be captured by a Turing machine. Taking the computable world seriously as ontology, a prime example of an anti-classical conception related the Markovian school is the permitted subcountability of various uncountable collections. Adopting the subcountability of the collection of all unending sequences of natural numbers (${\displaystyle {\mathbb {N} }^{\mathbb {N} ))$) as an axiom, the "smallness" (in classical terms) of this collections in some realizations of a set theory is then already captured by that theory. A constructive theory may also adopt neither classical nor anti-classical axioms and so stay agnostic towards either possibility.

Constructive principles already prove ${\displaystyle \forall (x\in X).\neg \neg {\big (}Q(x)\lor \neg Q(x){\big )))$ and so for any given element ${\displaystyle x}$ of ${\displaystyle X}$, the corresponding excluded middle statement for the proposition cannot be negated. Indeed, for any given ${\displaystyle x}$, by noncontradiction it is impossible to rule out ${\displaystyle Q(x)}$ and rule out its negation both at once. But a theory may in some instances also permit the rejection claim ${\displaystyle \neg \forall (x\in X).{\big (}Q(x)\lor \neg Q(x){\big )))$. Adopting this does not necessitate providing a particular ${\displaystyle t\in X}$ witnessing the failure of excluded middle for the particular proposition ${\displaystyle Q(t)}$, i.e. witnessing the inconsistent ${\displaystyle \neg {\big (}Q(t)\lor \neg Q(t){\big )))$. One may reject the possibility of decidability of some predicate ${\displaystyle Q(x)}$ on an infinite domain ${\displaystyle X}$ without making any existence claim in ${\displaystyle X}$. As another example, such a situation is enforced in Brouwerian intuitionistic analysis, in a case where the quantifier ranges over infinitely many unending binary sequences and ${\displaystyle Q(x)}$ states that a sequence ${\displaystyle x}$ is everywhere zero. Concerning this property, of being conclusively identified as the sequence which is forever constant, adopting Brouwer's continuity principle rules out that this could be proven decidable for all the sequences. The venture of translating such ideas into set theoretical language has been undertaken.

So in a constructive context with a so-called non-classical logic as used here, one may consistently adopt axioms which are both in contradiction to forms of excluded middle, but also non-constructive in the computable sense or as gauged by meta-logical existence properties discussed previously. In that way, a constructive set theory can also provide the framework to study non-classical theories.

History and overview

Historically, the subject of constructive set theory (often also "${\displaystyle {\mathsf {CST))}$") begun with John Myhill's work on the theories also called ${\displaystyle {\mathsf {IZF))}$ and ${\displaystyle {\mathsf {CST))}$.[1] In 1973, he had proposed the former as a first-order set theory based on intuitionistic logic, taking the most common foundation ${\displaystyle {\mathsf {ZFC))}$ and throwing out the Axiom of choice as well as the principle of the excluded middle, initially leaving everything else as is. However, different forms of some of the ${\displaystyle {\mathsf {ZFC))}$ axioms which are equivalent in the classical setting are inequivalent in the constructive setting, and some forms imply ${\displaystyle {\mathrm {PEM} ))$, as will be demonstrated. In those cases, the intuitionistically weaker formulations were consequently adopted. The far more conservative system ${\displaystyle {\mathsf {CST))}$ is also a first-order theory, but of several sorts and bounded quantification, aiming to provide a formal foundation for Errett Bishop's program of constructive mathematics.

The main discussion presents sequence of theories in the same language as ${\displaystyle {\mathsf {ZF))}$, leading up to Peter Aczel's well studied ${\displaystyle {\mathsf {CZF))}$,[2] and beyond. Many modern results trace back to Rathjen and his students. ${\displaystyle {\mathsf {CZF))}$ is also characterized by the two features present also in Myhill's theory: On the one hand, it is using the Predicative Separation instead of the full, unbounded Separation schema, see also Lévy hierarchy. Boundedness can be handled as a syntactic property or, alternatively, the theories can be conservatively extended with a higher boundedness predicate and its axioms. Secondly, the impredicative Powerset axiom is discarded, generally in favor of related but weaker axioms. The strong form is very casually used in classical general topology. Adding ${\displaystyle {\mathrm {PEM} ))$ to a theory even weaker than ${\displaystyle {\mathsf {CZF))}$ recovers ${\displaystyle {\mathsf {ZF))}$, as detailed below.[3] The system, which has come to be known as Intuitionistic Zermelo–Fraenkel set theory (${\displaystyle {\mathsf {IZF))}$), is a strong set theory without ${\displaystyle {\mathrm {PEM} ))$. It is similar to ${\displaystyle {\mathsf {CZF))}$, but less conservative or predicative. The theory denoted ${\displaystyle {\mathsf {IKP))}$ is the constructive version of ${\displaystyle {\mathsf {KP))}$, the classical Kripke–Platek set theory without a form of Powerset and where even the Axiom of Collection is bounded.

Models

As far as constructive realizations go there is a relevant realizability theory. Relatedly, Aczel's theory constructive Zermelo-Fraenkel ${\displaystyle {\mathsf {CZF))}$ has been interpreted in a Martin-Löf type theories, as described below. In this way, set theory theorems provable in ${\displaystyle {\mathsf {CZF))}$ and weaker theories are candidates for a computer realization.

For a set theory context without infinite sets, constructive first-order arithmetic can also be taken as an apology for most axioms adopted in ${\displaystyle {\mathsf {CZF))}$: The arithmetic theory ${\displaystyle {\mathsf {HA))}$ is bi-interpretable with a weak constructive set theory, as described in the article on Heyting arithmetic. One may arithmetically characterize a membership relation "${\displaystyle \in }$" and with it prove - instead of the existence of a set of natural numbers ${\displaystyle \omega }$ - that all sets in its theory are in bijection with a (finite) von Neumann natural, a principle denoted ${\displaystyle {\mathrm {V} }={\mathrm {Fin} ))$. This context further validates Extensionality, Pairing, Union, Binary Intersection (which is related to the Axiom schema of predicative separation) and the Set Induction schema. Taken as axioms, the aforementioned principles constitute a set theory that is already identical with the theory given by ${\displaystyle {\mathsf {CZF))}$ minus the existence of ${\displaystyle \omega }$ but plus ${\displaystyle {\mathrm {V} }={\mathrm {Fin} ))$ as axiom. All those axioms are discussed in detail below. Relatedly, ${\displaystyle {\mathsf {CZF))}$ also proves that the hereditarily finite sets fulfill all the previous axioms. This is a result which persists when passing on to ${\displaystyle {\mathsf {PA))}$ and ${\displaystyle {\mathsf {ZF))}$ minus Infinity.

Many theories studied in constructive set theory are mere restrictions of Zermelo–Fraenkel set theory (${\displaystyle {\mathsf {ZF))}$) with respect to their axiom as well as their underlying logic. Such theories can then also be interpreted in any model of ${\displaystyle {\mathsf {ZF))}$.

More recently, presheaf models for constructive set theories have been introduced. These are analogous to presheaf models for intuitionistic set theory developed by Dana Scott in the 1980s.[4][5][6]

Subtheories of ZF

Notation

Language

The propositional connective symbols used to form syntactic formulas are standard. The axioms of set theory give a means to prove equality "${\displaystyle =}$" of sets and that symbol may, by abuse of notation, be used for classes. Negation "${\displaystyle \neg }$" of elementhood "${\displaystyle \in }$" is often written "${\displaystyle \notin }$", and usually the same goes for non-equality "${\displaystyle \neq }$", although in constructive mathematics the latter symbol is also used in the context with apartness relations.

Variables

Below the Greek ${\displaystyle \phi }$ denotes a predicate variable in axiom schemas and ${\displaystyle P}$ or ${\displaystyle Q}$ is used for particular predicates. The word "predicate" is often used interchangeably with "formulas" as well, even in the unary case.

Quantifiers range over sets and those are denoted by lower case letters. As is common, one may use argument brackets to express predicates, for the sake of highlighting particular free variables in their syntactic expression, as in "${\displaystyle P(z)}$".

One abbreviates ${\displaystyle \forall z.{\big (}z\in A\to P(z){\big )))$ by ${\displaystyle \forall (z\in A).P(z)}$ and ${\displaystyle \exists z.{\big (}z\in A\land P(z){\big )))$ by ${\displaystyle \exists (z\in A).P(z)}$. The syntactic notion of bounded quantification in this sense can play a role in the formulation of axiom schemas, as seen below.

Express the subclass claim ${\displaystyle \forall (z\in A).z\in B}$, i.e. ${\displaystyle \forall z.(z\in A\to z\in B)}$, by ${\displaystyle A\subset B}$. The similar notion of subset-bounded quantifiers, as in ${\displaystyle \forall (z\subset A).z\in B}$, has been used in set theoretical investigation as well, but will not be further highlighted here.

Unique existence ${\displaystyle \exists !x.P(x)}$ here means ${\displaystyle \exists x.\forall y.{\big (}y=x\leftrightarrow P(y){\big )))$.

Classes

As is also common in the study of set theories, one makes use set builder notation for classes, which, in most contexts, are not part of the object language but used for concise discussion. In particular, one may introduce notation declarations of the corresponding class via "${\displaystyle A=\{z\mid P(z)\))$", for the purpose of expressing ${\displaystyle P(a)}$ as ${\displaystyle a\in A}$. Logically equivalent predicates can be used to introduce the same class. One also writes ${\displaystyle \{z\in B\mid P(z)\))$ as shorthand for ${\displaystyle \{z\mid z\in B\land P(z)\))$. For a property ${\displaystyle P}$, trivially ${\displaystyle \forall z.{\big (}(z\in B\land P(z))\to z\in B{\big )))$. And so follows that ${\displaystyle \{z\in B\mid P(z)\}\subset B}$.

Equality

Denote by ${\displaystyle A\simeq B}$ the statement expressing that two classes have exactly the same elements, i.e. ${\displaystyle \forall z.(z\in A\leftrightarrow z\in B)}$, or equivalently ${\displaystyle (A\subset B)\land (B\subset A)}$. This is not to be conflated with the concept of equinumerosity.

The following axiom gives a means to prove equality "${\displaystyle =}$" of two sets, so that through substitution, any predicate about ${\displaystyle x}$ translates to one of ${\displaystyle y}$.

 ${\displaystyle \forall x.\forall y.\ \ x\simeq y\to x=y}$

By the logical properties of equality, the converse direction holds automatically.

In a constructive interpretation, the elements of a subclass ${\displaystyle A=\{z\in B\mid Q(z)\lor \neg Q(z)\))$ of ${\displaystyle B}$ may come equipped with more information than those of ${\displaystyle B}$, in the sense that being able to judge ${\displaystyle b\in A}$ is being able to judge ${\displaystyle Q(b)\lor \neg Q(b)}$. And (unless the whole disjunction follows from axioms) in the Brouwer–Heyting–Kolmogorov interpretation, this means to have proven ${\displaystyle Q(b)}$ or having rejected it. As ${\displaystyle Q}$ may be not decidable for all elements in ${\displaystyle B}$, the two classes must a priori be distinguished.

Consider a property ${\displaystyle P}$ that provenly holds for all elements of a set ${\displaystyle y}$, so that ${\displaystyle \{z\in y\mid P(z)\}\simeq y}$, and assume that the class on the left hand side is established to be a set. Note that, even if this set on the left informally also ties to proof-relevant information about the validity of ${\displaystyle P}$ for all the elements, the Extensionality axiom postulates that, in our set theory, the set on the left hand side is judged equal to the one on the right hand side. While often adopted, this axiom has been criticized in constructive thought, as it effectively collapses differently defined properties, or at least the sets viewed as the extension of these properties, a Fregian notion.

Modern type theories may instead aim at defining the demanded equivalence "${\displaystyle \simeq }$" in terms of functions, see e.g. type equivalence. The related concept of function extensionality is often not adopted in type theory.

Other frameworks for constructive mathematics might instead demand a particular rule for equality or apartness come for the elements ${\displaystyle z\in x}$ of each and every set ${\displaystyle x}$ discussed. Even then, the above definition can be used to characterize equality of subsets ${\displaystyle u\subset x}$ and ${\displaystyle v\subset x}$. Note that adopting "${\displaystyle =}$" as a symbol in a predicate logic theory makes equality of two terms a quantifier-free expression.

Merging sets

Two other basic axioms are as follows. Firstly,

 ${\displaystyle \forall x.\forall y.\ \ \exists p.\forall z.{\big (}(z=x\lor z=y)\to z\in p{\big )))$

saying that for any two sets ${\displaystyle x}$ and ${\displaystyle y}$, there is at least one set ${\displaystyle p}$, which hold at least those two sets (${\displaystyle z}$).

And then,

 ${\displaystyle \forall x.\ \ \exists u.\forall y.{\big (}(\exists z.y\in z\land z\in x)\to y\in u{\big )))$

saying that for any set ${\displaystyle x}$, there is at least one set ${\displaystyle u}$, which holds all members ${\displaystyle y}$, of ${\displaystyle x}$'s members ${\displaystyle z}$.

The two axioms may also be formulated stronger in terms of "${\displaystyle \leftrightarrow }$". In the context of ${\displaystyle {\mathsf {BCST))}$ with Separation, this is not necessary.

Together, the two previous axioms imply the existence of the binary union of two classes ${\displaystyle a}$ and ${\displaystyle b}$ when they have been established to be sets, and this is denoted by ${\displaystyle \bigcup \{a,b\))$ or ${\displaystyle a\cup b}$. For a fixed set ${\displaystyle y}$, to validate membership ${\displaystyle y\in a\cup b}$ in the union of two given sets ${\displaystyle z=a}$ and ${\displaystyle z=b}$, one needs to validate the ${\displaystyle y\in z}$ part of the axiom, which can be done by validating the disjunction of the predicates defining the sets ${\displaystyle a}$ and ${\displaystyle b}$, for ${\displaystyle y}$.

Define class notation for a few given elements via disjunctions, e.g. ${\displaystyle c\in \{a,b\))$ says ${\displaystyle (c=a)\lor (c=b)}$. Denote by ${\displaystyle \langle x,y\rangle }$ the standard ordered pair model ${\displaystyle \{\{x\},\{x,y\}\))$.

Set existence

The property that is false for any set corresponds to the empty class, which is denoted by ${\displaystyle \{\))$ or zero, 0. That the empty class is a set readily follows from other axioms, such as the Axiom of Infinity below. But if, e.g., one is explicitly interested in excluding infinite sets in one's study, one may at this point adopt the

 ${\displaystyle \exists x.\forall y.\,\neg (y\in x)}$

This axiom would also readily be accepted, but is not relevant in the context of stronger axioms below. Introduction of the symbol ${\displaystyle \{\))$ (as abbreviating notation for expressions in involving characterizing properties) is justified as uniqueness for this set can be proven. If there provenly exists a set ${\displaystyle t\in s}$ inside a set ${\displaystyle s}$, then we call ${\displaystyle s}$ inhabited and it is then provenly not the empty set. While classically equivalent, constructively non-empty is a weaker notion with two negations. Unfortunately, the word for the more useful notion of 'inhabited' is rarely used in classical mathematics.

For a set ${\displaystyle x}$, define the successor set ${\displaystyle Sx}$ as ${\displaystyle x\cup \{x\))$, for which ${\displaystyle x\in Sx}$. A sort of blend between pairing and union, an axiom more readily related to the successor is the Axiom of adjunction.[7][8] It is relevant for the standard modeling of individual Neumann ordinals.

A simple and provenly false proposition then is, for example, ${\displaystyle \{\}\in \{\))$, corresponding to ${\displaystyle 0<0}$ in the standard arithmetic model. Again, here symbols such as ${\displaystyle \{\))$ are treated as convenient notation and any proposition really translates to an expression using only "${\displaystyle \in }$" and logical symbols, including quantifiers. Accompanied by a metamathematical analysis that the capabilities of the new theories are equivalent in an effective manner, formal extensions by symbols such as ${\displaystyle 0}$ may also be considered.

BCST

The following makes use of axiom schemas, i.e. axioms for some collection of predicates. Note that some of the stated axiom schemas are often presented with set parameters ${\displaystyle v}$ as well, i.e. variants with extra universal closures ${\displaystyle \forall v}$ such that the ${\displaystyle \phi }$'s may depend on the parameters.

Separation

Basic constructive set theory ${\displaystyle {\mathsf {BCST))}$ consists of several axioms also part of standard set theory, except the Separation axiom is weakened. Beyond the four axioms above, it the Predicative Separation as well as the Replacement schema.

 Axiom schema of predicative separation: For any bounded predicate ${\displaystyle \phi }$ with set variable ${\displaystyle y}$ not free in it, ${\displaystyle \forall y.\,\exists s.\forall x.{\big (}x\in s\,\leftrightarrow \,(x\in y\land \phi (x)){\big )))$

This axiom amounts to postulating the existence of a set ${\displaystyle s}$ obtained by the intersection of any set ${\displaystyle y}$ and any predicatively described class ${\displaystyle \{x\mid \phi (x)\))$. When the predicate is taken as ${\displaystyle x\in z}$ for ${\displaystyle z}$ proven to be a set, one obtains the binary intersection of sets and writes ${\displaystyle s=y\cap z}$. Intersection corresponds to conjunction in an analog way to how union corresponds to disjunction.

As noted, from Separation and the existence of at least one set (e.g. Infinity below) and a predicate that is false of any set, like ${\displaystyle \neg (x=x)}$, will follow the existence of the empty set. Within this conservative context of ${\displaystyle {\mathsf {BCST))}$, the Bounded Separation schema is actually equivalent to Empty Set plus the existence of the binary intersection for any two sets. The latter variant of axiomatization does not make use of a formula schema.

The axiom schema is also called Bounded Separation, as in Separation for set-bounded quantifiers only. It is a schema that takes into account syntactic aspects of predicates. The scope of legal formulas is enriched by further set existence postulates. The bounded formulas are also denoted by ${\displaystyle \Delta _{0))$ in the set theoretical Lévy hierarchy, in analogy to ${\displaystyle \Delta _{0}^{0))$ in the arithmetical hierarchy. (Note however that the arithmetic classification is sometimes expressed not syntactically but in terms of subclasses of the naturals. Also, the bottom level of the arithmetical hierarchy has several common definitions, some not allowing the use of some total functions. The distinction is not relevant on the level ${\displaystyle \Sigma _{1}^{0))$ or higher.) The schema is also the way in which Mac Lane weakens a system close to Zermelo set theory ${\displaystyle {\mathsf {Z))}$, for mathematical foundations related to topos theory.

No universal set

The following holds for any relation ${\displaystyle E}$, giving a purely logical condition by which two terms ${\displaystyle s}$ and ${\displaystyle y}$ non-relatable

${\displaystyle \forall x.{\big (}xEs\leftrightarrow (xEy\land \neg xEx){\big )}\to \neg (yEs\lor sEs\lor sEy)}$

The expression ${\displaystyle \neg (x\in x)}$ is a bounded one and thus allowed in separation. By virtue of the rejection of the final disjunct above, ${\displaystyle \neg sEy}$, Russel's construction shows that ${\displaystyle \{x\in y\mid x\notin x\}\notin y}$. So for any set ${\displaystyle y}$, Predicative Separation alone implies that there exists a set which is not a member of ${\displaystyle y}$. In particular, no universal set can exist in this theory. In a theory with the axiom of regularity, like ${\displaystyle {\mathsf {ZF))}$, of course that subset ${\displaystyle \{x\in y\mid x\notin x\))$ can be proven to be equal to ${\displaystyle y}$ itself. As an aside, in a theory with stratification, a universal set may exist because use of the syntactic expression ${\displaystyle x\in x}$ may be disallowed in proofs of existence by, essentially, separation.

Predicativity

The restriction in the axiom is also gatekeeping impredicative definitions: Existence should at best not be claimed for objects that are not explicitly describable, or whose definition involves themselves or reference to a proper class, such as when a property to be checked involves a universal quantifier. So in a constructive theory without Axiom of power set, when ${\displaystyle Q}$ denotes some 2-ary predicate, one should not generally expect a subclass ${\displaystyle s}$ of ${\displaystyle y}$ to be a set, in case that it is defined, for example, as in

${\displaystyle \{x\in y\mid \forall t.{\big (}(t\subset y)\to Q(x,t){\big )}\))$,

or via a similar definitions involving any quantification over the sets ${\displaystyle t\subset y}$. Note that if this subclass ${\displaystyle s}$ of ${\displaystyle y}$ is provenly a set, then this subset itself is also in the unbounded scope of set variable ${\displaystyle t}$. In other words, as the subclass property ${\displaystyle s\subset y}$ is fulfilled, this exact set ${\displaystyle s}$, defined using the expression ${\displaystyle Q(x,s)}$, would play a role in its own characterization.

While predicative Separation leads to fewer given class definitions being sets, it must be emphasized that many class definitions that are classically equivalent are not so when restricting oneself to constructive logic. So in this way, one gets a broader theory, constructively. Due to the potential undecidability of general predicates, the notion of subset and subclass is more elaborate in constructive set theories than in classical ones. This remains true if full Separation is adopted, as in the theory ${\displaystyle {\mathsf {IZF))}$, which however spoils the existence property as well as the standard type theoretical interpretations, and in this way spoils a bottom-up view of constructive sets. As an aside, as subtyping is not a necessary feature of constructive type theory, constructive set theory can be said to quite differ from that framework.

Replacement

Next consider the

 Axiom schema of Replacement: For any predicate ${\displaystyle \phi }$ with set variable ${\displaystyle r}$ not free in it, ${\displaystyle \forall d.\ \ \forall (x\in d).\exists !y.\phi (x,y)\to \exists r.\forall y.{\big (}y\in r\leftrightarrow \exists (x\in d).\phi (x,y){\big )))$

It is granting existence, as sets, of the range of function-like predicates, obtained via their domains. In the above formulation, the predicate is not restricted akin to the Separation schema, but this axiom already involves an existential quantifier in the antecedent. Of course, weaker schemas could be considered as well.

With the Replacement schema, this theory proves that the equivalence classes or indexed sums are sets. In particular, the Cartesian product, holding all pairs of elements of two sets, is a set. Equality of elements inside a set ${\displaystyle x}$ is decidable if the corresponding relation as a subset of ${\displaystyle x\times x}$ is decidable.

Replacement is not necessary in the design of a weak constructive set theory that is bi-interpretable with Heyting arithmetic ${\displaystyle {\mathsf {HA))}$. However, some form of induction is. Replacement together with Set Induction (introduced below) also suffices to axiomize hereditarily finite sets constructively and that theory is also studied without Infinity. For comparison, consider the very weak classical theory called General set theory that interprets the class of natural numbers and their arithmetic via just Extensionality, Adjunction and full Separation.

Replacement can be seen as a form of comprehension. Only when assuming ${\displaystyle {\mathrm {PEM} ))$ does Replacement already imply full Separation. In ${\displaystyle {\mathsf {ZF))}$, Replacement is mostly important to prove the existence of sets of high rank, namely via instances of the axiom schema where ${\displaystyle \phi (x,y)}$ relates relatively small set ${\displaystyle x}$ to bigger ones, ${\displaystyle y}$.

Constructive set theories commonly have Axiom schema of Replacement, sometimes restricted to bounded formulas. However, when other axioms are dropped, this schema is actually often strengthened - not beyond ${\displaystyle {\mathsf {ZF))}$, but instead merely to gain back some provability strength. Such stronger axioms exist that do not spoil the strong existence properties of a theory, as discussed further below.

The discussion now proceeds with axioms granting existence of objects also found in dependent type theory, namely natural numbers and products.

ECST

Denote by ${\displaystyle \mathrm {Ind} (A)}$ the inductive property, ${\displaystyle 0\in A\land \forall (n\in A).Sn\in A}$. Here ${\displaystyle n}$ denotes a generic set variable. In terms of a predicate ${\displaystyle P}$ underlying the class so that ${\displaystyle \forall n.(n\in A)\leftrightarrow P(n)}$, this translates to ${\displaystyle P(0)\land \forall n.{\big (}P(n)\to P(Sn){\big )))$.

For some fixed predicate ${\displaystyle Q}$, the statement ${\displaystyle Q(a)\land {\big (}\forall x.Q(x)\to a\subset x{\big )))$ expresses that ${\displaystyle a}$ is the smallest (in the sense of "${\displaystyle \subset }$") set among all sets ${\displaystyle x}$ for which ${\displaystyle Q(x)}$ holds true.

The elementary constructive Set Theory ${\displaystyle {\mathsf {ECST))}$ has the axiom of ${\displaystyle {\mathsf {BCST))}$ as well as the postulate of the existence of a smallest inductive set

 ${\displaystyle \exists w.{\Big (}\mathrm {Ind} (w)\,\land \,{\big (}\forall x.\mathrm {Ind} (x)\to w\subset x{\big )}{\Big )))$

Write ${\displaystyle \bigcap B}$ for ${\displaystyle \{x\mid \forall (y\in B).x\in y\))$, the general intersection. Define a class ${\displaystyle \omega =\bigcap \{x\mid \mathrm {Ind} (x)\))$, the intersection of all inductive sets. With the above axiom, ${\displaystyle \omega }$ is a uniquely characterized set, the smallest infinite von Neumann ordinal. Its elements include the empty set and, for each set in ${\displaystyle \omega }$, another set in ${\displaystyle \omega }$ that contains one element more. Symbols called zero and successor are in the signature of the theory of Peano. In ${\displaystyle {\mathsf {BCST))}$, the above defined successor of any number also being in the class ${\displaystyle \omega }$ follow directly from the characterization of the natural naturals by our von Neumann model. Since the successor of such a set contains itself, one also finds that no successor equals zero. So two of the Peano axioms regarding the symbols zero and the one regarding closedness of ${\displaystyle S}$ come easily. Fourthly, in ${\displaystyle {\mathsf {ECST))}$, where ${\displaystyle \omega }$ is a set, ${\displaystyle S}$ can be proven to be an injective operation.

The pairwise order "${\displaystyle <}$" on the naturals is captured by their membership relation "${\displaystyle \in }$". It is important to note that the theory proves the order as well as the equality relation on this set to be decidable. The value of formulating the axiom using the inductive property is explained in the discussion on arithmetic. Weak forms of axioms of infinity can be formulated, all postulating that some set containing elements with the common natural number properties exist. Then full Separation may be used to obtain the "sparse" such set, the set of natural numbers. In the context of otherwise weaker axiom systems, an axiom of infinity should be strengthened so as to imply existence of such a sparse set on its own. One weaker form of Infinity is

${\displaystyle \exists w.\forall m.{\big (}m\in w\leftrightarrow (m=0\lor (\exists p\in w).E(p,m)){\big )))$,

where ${\displaystyle E(p,m)}$ captures the predecessor membership relation in the von Neumann model

${\displaystyle \forall n.(n\in m\leftrightarrow (n=p\lor n\in p))}$.

This weaker axioms characterizes the infinite set by expressing that all elements ${\displaystyle m}$ of it are either equal to ${\displaystyle 0}$ or themselves hold a predecessor set which shares all other members with ${\displaystyle m}$. This form can also be written more concisely using the successor notation ${\displaystyle S}$.

Number bounds

For a class of numbers ${\displaystyle I\subset \omega }$, the statement

${\displaystyle \exists (m\in \omega ).\forall (n\in \omega ).(n\in I\to n

or the weaker contrapositive variant

${\displaystyle \exists (m\in \omega ).\forall (n\in \omega ).(m\leq n\to n\notin I)}$

are statements of finiteness. For decidable properties, these are ${\displaystyle \Sigma _{2}^{0))$-statements in arithmetic, but with the axiom of Infinity, the two quantifiers are set-bound. Denote an initial segment of the natural numbers, i.e. ${\displaystyle \{n\in \omega \mid n for any ${\displaystyle m\in \omega }$ and including the empty set, by ${\displaystyle \{0,1,\dots ,m-1\))$. This set equals ${\displaystyle m}$ and so at this point "${\displaystyle m-1}$" is mere notation for its predecessor (i.e. not involving subtraction function). To reflect more closely the discussion of functions below, write the above condition as

${\displaystyle \exists (m\in \omega ).\forall (n\in I).(n.

Now for a general set, to be finitely enumerable shall mean that there is a surjection from a von Neumann natural number onto it, which is a function existence claim. Further, to be finite means there is a bijective function to a natural. To be subfinite means to be a subset of a finite set. The claim that being a finite set is equivalent to being subfinite is equivalent to ${\displaystyle {\mathrm {PEM} ))$. Terminology for finiteness conditions varies with authors and there are many more related definitions.

For a class ${\displaystyle C}$, the statement

${\displaystyle \forall (m\in \omega ).\exists (n\in \omega ).(m\leq n\land n\in C)}$

is one of infinitude. It is ${\displaystyle \Pi _{2}^{0))$ in the decidable arithmetic case. To validate infinitude of a set, this property even works if the set holds other elements besides infinitely many of members of ${\displaystyle \omega }$. But more generally, call a set infinite if one can inject ${\displaystyle \omega }$ into it, which is again a function existence claim.

It is appropriate to discuss the function concept at this point.

Functions

General notes on functions

Naturally, the logical meaning of existence claims is a topic of interest in intuitionistic logic, be it for a theory of sets or any other mathematical framework. A constructive proof calculus may validate statements as above,

${\displaystyle \forall (a\in A).\exists (c\in C).P(a,c)}$,

in terms of programs on represented domains. Consider for example the notions of proof through type- or realizability theory. Roughly, the task then is to provide a mapping ${\displaystyle a\mapsto c_{a))$ and witness the rewriting ${\displaystyle \forall (a\in A).P(a,c_{a})}$.

It is a theorem that already Robinson arithmetic ${\displaystyle {\mathsf {Q))}$ represents exactly the recursive functions in terms of particular predicates ${\displaystyle P}$, which are then also proven total functional,

${\displaystyle \forall (a\in {\mathbb {N} }).\exists !(c\in {\mathbb {N} }).P(a,c)}$.

The weak classical arithmetic theory ${\displaystyle {\mathsf {Q))}$ postulates, instead of using the full mathematical induction schema for arithmetic formulas, that every number is either zero or that there exists a predecessor number to it.

Finally, beware of a common ambiguity in related texts on recursion theory, where "function" needs to be understood in the computable sense, which is generally narrower than what is discussed further below. Similarly, below there is also no need to speak of "total functions", as this is part of the definition of a set theoretical function.

Total functional relations

Now in the current set theoretical approach, define the property involving the function application brackets, ${\displaystyle f(a)=c}$, as ${\displaystyle \langle a,c\rangle \in f}$ and speak of a function ${\displaystyle f\subset A\times C}$ when provenly

${\displaystyle \forall (a\in A).\,\exists !(c\in C).f(a)=c}$,

i.e.

${\displaystyle \forall (a\in A).\,\exists (c\in C).\,\forall (d\in C).{\big (}d=c\leftrightarrow \langle a,d\rangle \in f{\big )))$,

which notably involves quantifier explicitly asking for existence. So one studies sets capturing particular total relations. Whether a subclass can be judged to be a function will depend on the strength of the theory, which is to say the axioms one adopts. Notably, a general class could fulfill the above predicate without being a subclass of the product ${\displaystyle A\times C}$, i.e. the property is expressing not more or less than functionality w.r.t. inputs from ${\displaystyle A}$. If the domain is a set, then the function has a pair for each of its elements and so exists as set. If domain and codomain are sets, then the above predicate only involves bounded quantifiers. Let ${\displaystyle C^{A))$ (also written ${\displaystyle ^{A}C}$) denote the class of set functions. When functions are understood as just function graphs as above, the membership proposition ${\displaystyle f\in C^{A))$ is also written ${\displaystyle f\colon A\to C}$. Below might write ${\displaystyle x\to y}$ for ${\displaystyle y^{x))$ for the sake of distinguishing it from ordinal exponentiation.

Common notions such as surjectivity and injectivity can be expressed in a bounded fashion as well. Note that injectivity shall be defined positively, not by its contrapositive, which is common practice in classical mathematics.

The axiom scheme of Replacement can also be formulated in terms of the ranges of such set functions. It is a metatheorem for theories containing ${\displaystyle {\mathsf {BCST))}$ that adding a function symbol for a provenly total class function is a conservative extension, despite this changing the scope of bounded Separation.

Separation lets us cut out subsets of products ${\displaystyle A\times C}$, at least when they are described in a bounded fashion. Write ${\displaystyle 1}$ for ${\displaystyle S0}$. Given any ${\displaystyle B\subset A}$, one is now led to reason about classes such as

${\displaystyle \{\langle x,y\rangle \in A\times \{0,1\}\mid (x\in B\land y=1)\lor (\neg (x\in B)\land y=0)\}.}$

The boolean-valued characteristic functions ${\displaystyle \chi _{B}\colon A\to \{0,1\))$ are among such classes. But be aware that ${\displaystyle a\in B}$ may in generally not be decidable. That is to say, in absence of any non-constructive axioms, the disjunction ${\displaystyle a\in B\lor a\notin B}$ may not be provable, since one requires an explicit proof of either disjunct. Constructively, when

${\displaystyle \exists (y\in \{0,1\}).f(a)=y}$

cannot be witnessed for all ${\displaystyle a\in A}$, or uniqueness of a term ${\displaystyle y}$ associated with ${\displaystyle a}$ not be proven, then one cannot judge the comprehended collection to be total functional.

Variants of the functional predicate definition using apartness relations on setoids have been defined as well. A function will be a set if its range is. Care must be taken with nomenclature "function", which sees use in most mathematical frameworks, also because some tie a function term itself to a particular codomain.

Computable sets

Given Infinity and any propositions ${\displaystyle Q}$, let ${\displaystyle I=\{k\in \omega \mid Q(k)\))$. Given any natural ${\displaystyle n\in \omega }$, then

${\displaystyle {\big (}Q(n)\lor \neg Q(n){\big )}\to {\big (}n\in I\lor n\notin I{\big )))$.

In classical set theory, as ${\displaystyle Q}$ is formally decidable just by ${\displaystyle {\mathrm {PEM} ))$, so is subclass membership. If the class ${\displaystyle I}$ is not finite, then successively going through the natural numbers ${\displaystyle n}$, and thus "listing" all numbers in ${\displaystyle I}$ by simply skipping those with ${\displaystyle n\notin I}$, classically constitutes an increasing surjective sequence ${\displaystyle a:\omega \twoheadrightarrow I}$. There, one can obtain a bijective function. In this way, the classical class of functions is provenly rich, as it also contains objects that are beyond what we know to be effectively computable, or programmatically listable in praxis.

In computability theory, the computable sets are ranges of non-decreasing total functions in the recursive sense, at the level ${\displaystyle \Sigma _{1}^{0}\cap \Pi _{1}^{0}=\Delta _{1}^{0))$ of the arithmetical hierarchy, and not higher. Deciding a predicate at that level amounts to solving the task of eventually finding a certificate that either validates or rejects membership. As not every predicate ${\displaystyle Q}$ is computably decidable, the theory ${\displaystyle {\mathsf {CZF))}$ alone will not claim (prove) that all infinite ${\displaystyle I\subset \omega }$ are the range of some bijective function with domain ${\displaystyle \omega }$. See also Kripke's schema.

But being compatible with ${\displaystyle {\mathsf {ZF))}$, the development in this section still always permits "function on ${\displaystyle \omega }$" to be interpreted as an object not necessarily given as lawlike sequence. Applications may be found in the common models for claims about probability, e.g. statements involving the notion of "being given" an unending random sequence of coin flips.

Choice functions

Choice principles postulate the existence of functions. These can then be translated to claims of existence of inverses, ordering, and so on. Choice moreover implies statements about cardinalities of different sets, e.g. they imply or rule out countability of sets. The constructive development here proceeds in a fashion agnostic to any discussed choice principles, but here are well studied variants:[9]

• Axiom of countable choice: If ${\displaystyle g\colon \omega \to z}$, one can form the one-to-many relation-set ${\displaystyle \{\langle n,u\rangle \mid n\in \omega \land u\in g(n)\))$. The axiom of countable choice would grant that whenever ${\displaystyle \forall (n\in \omega ).\exists u.u\in g(n)}$, one can form a function mapping each number to a unique value. Countable choice can also be weakened further. One common consideration is to restrict the possible cardinalities of the range of ${\displaystyle g}$, giving the weak countable choice into countable, finite or even just binary sets. Another means of weakening countable choice is by restricting the involved definitions w.r.t. their place in the syntactic hierarchies. Countable choice is not valid in the internal logic of a general topos, which can be seen as models of constructive set theories.
• Axiom of dependent choice: Countable choice is implied by the more general axiom of dependent choice, extracting a function from any entire relation on an inhabited set. Countable choice is akin to constructive Church's thesis principle and indeed dependent choice holds in many realizability models and it is thus adopted in many constructive schools.
• Relativized dependent choice: The stronger relativized dependent choice principle is a variant of it - a schema involving an extra predicate variable. Adopting this for just bounded formulas in ${\displaystyle {\mathsf {ECST))}$, the theory already proves the ${\displaystyle \Sigma _{1))$-induction.
• ${\displaystyle \Pi \Sigma }$-${\displaystyle AC}$: A family of sets is better controllable if it comes indexed by a function. A set ${\displaystyle B}$ is a base if all indexed families of sets ${\displaystyle i_{S}\colon B\to S}$ over it, have a choice function ${\displaystyle f_{S))$, i.e. ${\displaystyle \forall (x\in B).f_{S}(x)\in i_{S}(x)}$. A collection of sets holding ${\displaystyle \omega }$ and its elements and which is closed by taking indexed sums and products (see dependent type) is called ${\displaystyle \Pi \Sigma }$-closed. While the axiom that all sets in the smallest ${\displaystyle \Pi \Sigma }$-closed class are a base does need some work to formulate, it is the strongest principle over ${\displaystyle {\mathsf {CZF))}$ that holds in the type theoretical interpretation ${\displaystyle {\mathsf {ML_{1}V))}$.
• Axiom of choice: The axiom of choice concerning functions on general sets of inhabited sets. The codomain here is the general union of sets. It implies Dependent choice. It also implies instances of ${\displaystyle {\mathrm {PEM} ))$ via Diaconescu's theorem. In turn, extensional theories with full choice broadly tend to contradict the constructive Church's rule.

Diaconescu's theorem

To highlight the strength of full Choice and its relation to matters of intentionality, one should consider the classes

${\displaystyle a=\{u\in \{0,1\}\mid (u=0)\lor P\))$
${\displaystyle b=\{u\in \{0,1\}\mid (u=1)\lor P\))$

from the proof of Diaconescu's theorem. Referring back to the introductory elaboration on the meaning of such convenient class notation, as well as to the principle of distributivity, ${\displaystyle t\in a\leftrightarrow t=0\lor (t=1\land P)}$. So unconditionally, ${\displaystyle 0\in a}$, ${\displaystyle 1\in b}$. But otherwise, the uncountable classes ${\displaystyle a}$ and ${\displaystyle b}$ are as contingent as the proposition ${\displaystyle P}$ involved in their definition. Nonetheless, the setup entails several consequences, when inspecting the provable case, starting with ${\displaystyle P\to (a=\{0,1\}\land b=\{0,1\})}$. So ${\displaystyle P\to a=b}$ and indeed the equality is equivalent and decides ${\displaystyle P}$. As ${\displaystyle a}$ are ${\displaystyle b}$ are then sets, also ${\displaystyle P\to \{a,b\}=\{a\))$. A contrapositive gives ${\displaystyle \neg (a=b)\leftrightarrow \neg P}$, which is important for the proof of the theorem. In fact, as ${\displaystyle \neg P\to (a=\{0\}\land b=\{1\})}$ and, as ${\displaystyle \neg (0=1)}$, one finds in which way the sets are then different. One may moreover reason using the disjunctive syllogism that both ${\displaystyle 0\in b}$ and ${\displaystyle 1\in a}$ are each equivalent to ${\displaystyle P}$.

In the following assume a context in which ${\displaystyle a,b}$ are established to be sets, and thus subfinite sets. Then for inhabited such sets, the general axiom of choice claims existence of a function ${\displaystyle f\colon \{a,b\}\to a\cup b}$ with ${\displaystyle f(z)\in z}$. It is important that the elements ${\displaystyle a,b}$ of the function's domain are different than the natural numbers ${\displaystyle 0,1}$ in that a priori less is known about the former. When forming then union of the two classes, ${\displaystyle u=0\lor u=1}$ is a necessary but then also sufficient condition. Thus ${\displaystyle a\cup b=\{0,1\))$ and one is dealing with functions ${\displaystyle f}$ into a set of two distinguishable values. With choice come the conjunction ${\displaystyle f(a)\in a\land f(b)\in b}$ in the codomain of the function. Using the distributivity, there arises a list of conditions on the possible function return values, a disjunction. Expanding what is then established, one finds that either both ${\displaystyle P}$ as well as the sets equality, or that the return values are different and ${\displaystyle P}$ can be rejected. The conclusion is that the choice postulate actually implies ${\displaystyle P\lor \neg P}$ whenever a Separation axiom allows for set comprehension using undecidable ${\displaystyle P}$. Consider, for example, an undecidable membership claim inside a given set.

So full choice is generally non-constructive. The issue is that propositions, as part of set comprehension used to separate and define the classes ${\displaystyle a}$ and ${\displaystyle b}$ from ${\displaystyle \{0,1\))$, ramify truth values into set terms. Equality defined by the set theoretical axiom of extensionality, which itself is not related to functions, in turn couples knowledge about the predicate to information about function values. Spoken in terms function values: On the one hand, witnessing ${\displaystyle f(a)=1}$ implies ${\displaystyle P}$ and ${\displaystyle a=b}$ and this conclusion independently also applies to witnessing ${\displaystyle f(b)=0}$. On the other hand, witnessing ${\displaystyle f(a)=0\land f(b)=1}$ implies the two function arguments are not equal and this rules out ${\displaystyle P}$. There are really only three combinations, as the axiom of extensionality in the given setup makes ${\displaystyle f(a)=1\land f(b)=0}$ inconsistent. The conclusion can be summarized by the already formally derived equivalence of disjuncts ${\displaystyle (1\in a)\lor (0\in b)\lor \neg (a=b)\leftrightarrow (P\lor \neg P)}$. So if the constructive reading of existence is to be preserved, full choice may be not adopted in the set theory, because the mere claim of function existence does not realize a particular function.

To better understand why we cannot expect to be granted a definitive (total) function, consider naive function candidates. It was noted that it is the case that ${\displaystyle 0\in a}$ and ${\displaystyle 1\in b}$, regardless of ${\displaystyle P}$. So without further analysis, this would seem to make

${\displaystyle f=\{\langle a,0\rangle ,\langle b,1\rangle \))$

a contender for a choice function. Indeed, if ${\displaystyle P}$ can be rejected, this is the only option. But in the case of provability of ${\displaystyle P}$, when ${\displaystyle \{a,b\}=\{a\))$, there is extensionally only one possible function input to a choice function. So in that situation, a choice function would have type ${\displaystyle f\colon \{a\}\to \{0,1\))$, for example

${\displaystyle f=\{\langle a,0\rangle \))$

and this would rule out the initial contender. For general ${\displaystyle P}$, the domain of a would-be choice function is not concrete but contingent on ${\displaystyle P}$ and uncountable. When considering the above functional assignment ${\displaystyle f(a)=0}$, then neither unconditionally declaring ${\displaystyle f(b)=1}$ nor ${\displaystyle f(b)=0}$ is necessarily consistent. Having identified ${\displaystyle 1}$ with ${\displaystyle \{0\))$, the two candidates described above can be represented simultaneously via the uncountable ${\displaystyle f=\{\langle a,0\rangle ,\langle b,j\rangle \))$ with the would-be natural ${\displaystyle j=\{u\in \{0\}\mid \neg P\))$. In ${\displaystyle j}$, the proposition ${\displaystyle P}$ in the "if-clause" may be replaced by ${\displaystyle a=b}$. As ${\displaystyle (P\to j=0)\land (\neg P\to j=1)}$, postulating the classical ${\displaystyle P\lor \neg P}$ here would indeed imply that this is a choice function no matter which of two truth values ${\displaystyle P}$ takes. And as in the constructive case, given a particular choice function - a set holding either exactly one or exactly two pairs - one could actually infer whether ${\displaystyle P}$ or whether ${\displaystyle \neg P}$ does hold. Vice versa, the third and last candidate

${\displaystyle f=\{\langle b,1\rangle \))$

can be captured as part of ${\displaystyle f=\{\langle a,i\rangle ,\langle b,1\rangle \))$, where ${\displaystyle i=\{u\in \{0\}\mid P\))$. This is a classical choice function either way as well. Constructively, the domain and values of such ${\displaystyle P}$-dependent would-be functions will be undecidable and as such one fails to prove functional totality. In computable interpretations, set theory axioms postulating (total) function existence lead to the requirement for recursive functions. From a function realization one can infer the branches taken by the "if-clauses" of the classical solutions, which were undecided in the interpreted theory.

Regularity implies LEM

The axiom of regularity states that for every inhabited set ${\displaystyle s}$, there exists an element ${\displaystyle t}$ in ${\displaystyle s}$, which shares no elements with ${\displaystyle s}$. As opposed to the axiom of choice, this existence claim reaches for an element of every inhabited set, i.e. the "domain" are all inhabited sets. Its formulation does not involve a unique existence claim but instead guarantees a set with a specific property. As the axiom correlates membership claims at different rank, the axiom also ends up implying ${\displaystyle {\mathrm {PEM} ))$:

The proof from choice above had used a particular set ${\displaystyle \{a,b\))$ from above. The proof below also uses this ${\displaystyle b}$, for which it was already established that ${\displaystyle 0\in b\leftrightarrow P}$. Also recall that when Separation applies to ${\displaystyle P}$, the set ${\displaystyle b}$ is defined using the clause ${\displaystyle u\in \{0,1\))$, so that any given ${\displaystyle u\in b}$ has ${\displaystyle u=0\lor u=\{0\))$. Now let ${\displaystyle t\in b}$ be the postulated member with the empty intersection property, which in particular means ${\displaystyle t=\{0\}\to \neg (0\in b)}$. Together, one finds ${\displaystyle (0\in b)\lor \neg (0\in b)}$, which also formally decides ${\displaystyle P}$.

Arithmetic

The four Peano axioms for ${\displaystyle 0}$ and ${\displaystyle S}$, characterizing ${\displaystyle \omega }$ as a model of the natural numbers in ${\displaystyle {\mathsf {ECST))}$, have been discussed. The order "${\displaystyle <}$" of natural numbers is captured by membership "${\displaystyle \in }$" in this von Neumann model and this set is discrete, i.e. also equality is decidable. Indeed, also Heyting arithmetic proves

${\displaystyle {\mathsf {HA))\vdash \forall n.\forall m.{\big (}(n=m)\lor \neg (n=m){\big )))$

The first-order theory ${\displaystyle {\mathsf {HA))}$ has the same non-logical axioms as Peano arithmetic. An account of induction is given in the next paragraph. Then, it is clarified which set theory axiom must be asserted to prove existence of the binary functions addition "${\displaystyle +}$" and multiplication "${\displaystyle \times }$" with their respective relation to zero and successor.

Moderate induction in ECST

The second universally quantified conjunct in the axiom of Infinity expresses mathematical induction for all ${\displaystyle x}$ in the universe of discourse, i.e. for sets. This is because sets ${\displaystyle x}$ can be read as corresponding to predicates and the consequent ${\displaystyle \omega \subset x}$ states that all ${\displaystyle n\in \omega }$ fulfill said predicate. So ${\displaystyle {\mathsf {ECST))}$ proves induction for all predicates ${\displaystyle \phi (n)}$ involving only set-bounded quantifiers. The much stronger axiom of full mathematical induction for any predicate expressed though set theory language could also be adopted at this point in our development. That induction principle follows from full (i.e. unbounded) Separation as well as from (full) Set induction.

Note: In naming induction statements, one must take care not to conflate terminology with arithmetic theories. The first-order induction schema of natural number arithmetic claims induction for all predicates definable in the language of first-order arithmetic, namely predicates of just numbers. So to interpret the axiom schema of ${\displaystyle {\mathsf {HA))}$, one interprets these arithmetical formulas. One may also speak about the induction in second-order arithmetic, explicitly expressed for subsets of the naturals. The class of subsets can be taken to correspond to a richer collection of formulas than the first-order arithmetic definable ones. Typical set theories like the one discussed here are also first-order, but those theories are not arithmetics and so formulas may also quantify over the subsets of the naturals. Finally, bounded quantification in that context here means quantification over the elements of whatever is established to be a set.

Recursion

In ${\displaystyle {\mathsf {ECST))}$, many mathematical statements can be proven per individual set, opposed to many formulas involving universal quantification, as would be possible, for example, with an induction principle for classes. With this, the set theory axioms listed so far suffice as formalized framework for a good portion of basic mathematics. That said, the constructive set theory ${\displaystyle {\mathsf {ECST))}$ does actually not even enable primitive recursion for function definitions of what would be ${\displaystyle h\colon (x\times \omega )\to y}$. Indeed, despite having the Replacement axiom, the theory does not prove the addition function ${\displaystyle +\colon (\omega \times \omega )\to \omega }$ to be a set function. Going beyond ${\displaystyle {\mathsf {ECST))}$ with regards to arithmetic, the axiom granting definition of set functions via iteration-step set functions must be added: For any set ${\displaystyle y}$, set ${\displaystyle z\in y}$ and ${\displaystyle f\colon y\to y}$, there must also exist a function ${\displaystyle g\colon \omega \to y}$ attained by making use of the former, namely such that ${\displaystyle g(0)=z}$ and ${\displaystyle g(Sn)=f(g(n))}$. This postulate is akin to the transfinite recursive theorem, except it is restricted to set functions and finite ordinals, i.e. there is no clause about limit ordinals. It functions as the set theoretical equivalent of a natural numbers object in category theory. This then enables a full interpretation of Heyting arithmetic ${\displaystyle {\mathsf {HA))}$ in our set theory, including addition and multiplication functions.

With this, arithmetic of rational numbers ${\displaystyle {\mathbb {Q} ))$ can then also be defined and its properties, like uniqueness and countability, be proven. A set theory with this will also prove that, for any naturals ${\displaystyle n}$ and ${\displaystyle m}$, the function spaces

${\displaystyle {\{0,1,\dots ,n-1\))\to {\{0,1,\dots ,m-1\))}$

are sets. (As an aside, note that, moreover, a bounded variant of this iteration schema that grants the existence of a unique such ${\displaystyle g}$, proves the existence of a transitive closure for every set with respect to ${\displaystyle \in }$.)

Now conversely, a proof of the spelled out, ${\displaystyle {\mathsf {HA))}$-model enabling iteration principle can be based on the collection of functions one would want to write as the union ${\displaystyle \cup _{n\in \omega }y^{\{0,1,\dots ,n-1\))}$. The existence of this becomes provable when asserting that the individual function spaces on finite domains into sets ${\displaystyle y}$ form sets themselves. That principle may be written as

${\displaystyle \forall (n\in \omega ).\forall y.\ \ \exists h.h=y^{n))$

This should further motivate the adoption of an even stronger axiom of more set theoretical flavor, instead of just directly embedding arithmetic principles into our theory. This more set theoretical exponentiation axiom will, however, still not prove the full induction schema for formulas with quantifiers over sets.

Induction without Infinity

Before discussing (even classically) uncountable sets, here taking a step back to ${\displaystyle {\mathsf {BCST))}$, note that induction schemas may be adopted without ever postulating that the collection of naturals exists as a set. It is worth noting that in the program of predicative arithmetic, the mathematical induction schema has been criticized as possibly being impredicative, when natural numbers are defined as the object which fulfill this schema, which itself is defined in terms of all naturals. The minimal assumptions necessary to obtain theories of natural number arithmetic are thoroughly studied in proof theory and are naturally framed as insights into first- and second-order arithmetic theories.

The classical theories starting with bounded arithmetic adopt different conservative induction schemas and may add symbols for particular functions. On the first-order side, this leads to theories between the Robinson arithmetic ${\displaystyle {\mathsf {Q))}$ and Peano arithmetic ${\displaystyle {\mathsf {PA))}$: The theory ${\displaystyle {\mathsf {Q))}$ does not have any induction. ${\displaystyle {\mathsf {PA))}$ has full mathematical induction for arithmetical formulas and has ordinal ${\displaystyle \varepsilon _{0))$, meaning the theory lets one encode ordinals of weaker theories as recursive relation on just the naturals. Many of the well studied arithmetic theories are weak regarding proof of totality for some more fast growing functions. Some of the most basic examples of arithmetics include elementary function arithmetic ${\displaystyle {\mathsf {EFA))}$, which includes induction for just bounded arithemtical formulas, here meaning with quantifiers over finite number ranges. The theory has a proof theoretic ordinal (the least not provenly recursive well-ordering) of ${\displaystyle \omega ^{3))$. The ${\displaystyle \Sigma _{1}^{0))$-induction schema for arithmetical existential formulas allows for induction for those properties of naturals a validation of which is computable via a finite search with unbound (any, but finite) runtime. The schema is also classically equivalent to the ${\displaystyle \Pi _{1}^{0))$-induction schema. The relatively weak classical first-order arithmetic which adopts that schema is denoted ${\displaystyle {\mathsf {I\Sigma ))_{1))$ and proves the primitive recursive functions total. The theory ${\displaystyle {\mathsf {I\Sigma ))_{1))$ is ${\displaystyle \Pi _{2}^{0))$-conservative over primitive recursive arithmetic ${\displaystyle {\mathsf {PRA))}$. Note that the ${\displaystyle \Sigma _{1}^{0))$-induction is also part of the second-order reverse mathematics base system ${\displaystyle {\mathsf {RCA))_{0))$, its other axioms being ${\displaystyle {\mathsf {Q))}$ plus ${\displaystyle \Delta _{1}^{0))$-comprehension of subsets of naturals. The theory ${\displaystyle {\mathsf {RCA))_{0))$ is ${\displaystyle \Pi _{1}^{1))$-conservative over ${\displaystyle {\mathsf {I\Sigma ))_{1))$. Those last mentioned arithmetic theories all have ordinal ${\displaystyle \omega ^{\omega ))$.

Let us mention one more step beyond the ${\displaystyle \Sigma _{1}^{0))$-induction schema. Lack of stronger induction schemas means, for example, that some infinite versions of the pigeon hole principle are unprovable. One relatively weak one being the Ramsey theorem type claim here expressed as follows: For any ${\displaystyle m>0}$ and coding of a coloring map ${\displaystyle f}$, associating each ${\displaystyle n\in \omega }$ with a color ${\displaystyle \{0,1,\dots ,m-1\))$, it is not the case that for every color ${\displaystyle c there exists a threshold input number ${\displaystyle n_{c))$ beyond which ${\displaystyle c}$ is not ever the mappings return value anymore. Higher indirection as in induction for mere existential statements is needed to rewrite such a negation and prove it. Namely to rewrite it as the negation of the existence of a joint threshold number, depending on all the hypothetical ${\displaystyle n_{c))$'s, beyond which the function would still have to attain some color value. More specifically, the strength of the required bounding principle is strictly between the induction schema in ${\displaystyle {\mathsf {I\Sigma ))_{1}^{0))$ and ${\displaystyle {\mathsf {I\Sigma ))_{2}^{0))$. For properties in terms of return values of functions on finite domains, brute force verification through checking all possible inputs has computational overhead which is larger the larger the size of the domain, but always finite. Acceptance of an induction schema as in ${\displaystyle {\mathsf {I\Sigma ))_{2}^{0))$ validates the former so called infinite pigeon hole principle, which concerns unbounded domains, and so is about mappings with infinitely many inputs. In the classical context, this claim about coloring may be phrased positively, in terms of sets, as saying that there always exists at least one return value ${\displaystyle k}$ such that, in effect, for some infinite domain ${\displaystyle K\subset \omega }$ it holds that ${\displaystyle \forall (n\in K).f(n)=k}$. In words, when ${\displaystyle f}$ provides infinite enumerated assignments, each being of one of ${\displaystyle m}$ different possible colors, then a particular ${\displaystyle k}$ coloring infinitely many numbers is claimed to exist and that the set can be specified. When read constructively, one would want ${\displaystyle k}$ to be concretely specifiable.

Higher-order classical arithmetics with low complexity comprehension are a relevant reference point for weaker set theories insofar as their language does not merely express arithmetical sets, while all sets of naturals particular such theories prove to exist are just computable sets. Constructive reverse mathematics, which lacks double negation elimination for undecidable sentences, exists as a field but is less developed than its classical counterpart.

Exponentiation

Classical ${\displaystyle {\mathsf {ZFC))}$ without the Powerset axiom is still consistent with all existing sets of reals being subcountable, and there even countable.[10] Possible choice principles were discussed, a weakened form of the Separation schema was already adopted, and more of the standard ${\displaystyle {\mathsf {ZFC))}$ axioms shall be weakened for a more predicative and constructive theory. The first one of those is the Powerset axiom, which is adopted in the form of the space of characteristic functions, itself tied to exactly the decidable subclasses. So consider the axiom ${\displaystyle {\mathrm {Exp} ))$.

 Exponentiation ${\displaystyle \forall x.\forall y.\ \ \exists h.\forall f.{\big (}f\in h\leftrightarrow f\in y^{x}{\big )))$

The formulation here uses the convenient notation for function spaces. Otherwise the axiom is lengthier, characterizing ${\displaystyle h}$ using bounded quantifiers in the total function predicate. In words, the axiom says that given two sets ${\displaystyle x,y}$, the class ${\displaystyle y^{x))$ of all functions is, in fact, also a set. This is certainly required, for example, to formalize the object map of an internal hom-functor like ${\displaystyle {\mathrm {hom} }({\mathbb {N} },-)}$.

Existence statements like Exponentiation, i.e. function spaces being sets, enable the derivation of more sets via bounded Separation. Adopting the axiom, quantification ${\displaystyle \forall f}$ over the elements of certain classes of functions only ranges over a set, also when such function spaces are even classically uncountable. E.g. the collection of all functions ${\displaystyle f\colon \omega \to 2}$ where ${\displaystyle 2=\{0,1\))$, i.e. the set ${\displaystyle 2^{\mathbb {N} ))$ of points underlying the Cantor space, is uncountable, by Cantor's diagonal argument, and can at best be taken to be a subcountable set. (In this section and beyond, the symbol for the semiring of natural numbers in expressions like ${\displaystyle y^{\mathbb {N} ))$ is used, or written ${\displaystyle \omega \to y}$, just to avoid conflation of cardinal- with ordinal exponentiation.) Roughly, classically uncountable sets tend to not have computably decidable equality.

On countable sets

Enumerable forms of the pigeon hole principle can now be proven, e.g. that on a finitely enumerable set, every injection is also a surjection. At last, all finitely enumerable sets are finite. The finitely enumerable union of a family of subfinite resp. subcountable sets is itself subfinite resp. subcountable.

For any countable family of counting functions together with their ranges, the theory proves the union of those ranges to be countable. Recall that not even classical ${\displaystyle {\mathsf {ZF))}$ (without countable choice) proves a countable union of countable sets to be countable, as this requires infinitely many existential instantiations of functions. With Exponentiation, the union of all finite sequences over a countable set is now a countable set.

With function spaces with the finite von Neumann ordinals as domains, we can model ${\displaystyle {\mathsf {HA))}$ as discussed and can thus encode ordinals in the arithmetic. One then furthermore obtains the ordinal-exponentiated number ${\displaystyle \omega ^{\omega ))$ as a set, which may be characterized as ${\displaystyle \cup _{n\in \omega }\omega ^{n))$. Relatedly, the set theory then also proves the existence of any primitive recursive function on the naturals ${\displaystyle \omega }$, as set functions in the uncountable set ${\displaystyle \omega \to \omega }$.

As far as comprehension goes, the dependent or indexed products ${\displaystyle \Pi _{i\in x}\,y_{i))$ are now sets. The theory now proves the collection of all the countable subsets of any set (the collection is a subclass of the powerclass) to be a set.

The class of subsets of a set

The characterization of the class ${\displaystyle {\mathcal {P))_{x))$ of all subsets of a set ${\displaystyle x}$ involves unbounded universal quantification, namely ${\displaystyle \forall u.\left(u\subset x\leftrightarrow u\in {\mathcal {P))_{x}\right)}$. Here ${\displaystyle \subset }$ has been defined in terms of the membership predicate ${\displaystyle \in }$ above. So in a mathematical set theory framework, the power class is defined not in a bottom-up construction from its constituents (like an algorithm on a list, that e.g. maps ${\displaystyle \langle a,b\rangle \mapsto \langle \langle \rangle ,\langle a\rangle ,\langle b\rangle ,\langle a,b\rangle \rangle }$) but via a comprehension over all sets. If ${\displaystyle {\mathcal {P))_{x))$ is a set, that defining quantification even ranges over ${\displaystyle {\mathcal {P))_{x))$, which makes the axiom of powerset impredicative. The statement ${\displaystyle y={\mathcal {P))_{x))$ itself is ${\displaystyle \Pi _{1))$.

The richness of the powerclass in a theory without excluded middle can best be understood by considering small classically finite sets. For any proposition ${\displaystyle P}$, the class ${\displaystyle \{x\in \{0\}\mid P\}\subset \{0\))$ equals ${\displaystyle 0}$ when ${\displaystyle P}$ can be rejected and ${\displaystyle 1}$ (i.e. ${\displaystyle \{0\))$) when ${\displaystyle P}$ can be proven, but ${\displaystyle P}$ may also not be decidable at all. Consider three different undecidable proposition, none of which provenly imply another. They can ben used to define three subclasses of the singleton ${\displaystyle \{0\))$, none of which are provenly the same. In this view, the powerclass ${\displaystyle {\mathcal {P))_{1))$ of the singleton, usually denoted by ${\displaystyle \Omega }$, is called the truth value algebra and does not necessarily provenly have only two elements. The set ${\displaystyle 2^{x))$ of ${\displaystyle \{0,1\))$-valued functions on a set ${\displaystyle x}$ injects into the function space ${\displaystyle ((\mathcal {P))_{1))^{x))$ and corresponds to just its decidable subsets.

It has been pointed out that the empty set ${\displaystyle 0}$ and the set ${\displaystyle 1}$ itself are of course two subsets of ${\displaystyle 1}$. Whether also ${\displaystyle {\mathcal {P))_{1}\subset \{0,1\))$ is true in a theory is contingent on a simple disjunction:

${\displaystyle {\big (}\forall x.x\subset 1\to (0\in x\lor 0\notin x){\big )}\to {\mathcal {P))_{1}\subset \{0,1\))$.

So assuming ${\displaystyle {\mathrm {PEM} ))$ for just bounded formulas, predicative Separation then lets one demonstrate that the powerclass ${\displaystyle {\mathcal {P))_{1))$ is a set. With exponentiation, ${\displaystyle {\mathcal {P))_{1))$ being a set already implies Powerset for sets in general. The proof is via replacement for the association of ${\displaystyle f\in ((\mathcal {P))_{1))^{x))$ to ${\displaystyle \{z\in x\mid 0\in f(z)\}\in {\mathcal {P))_{x))$, and an argument why all subsets are covered. So in this context, also full Choice proves Powerset. Moreover, with bounded excluded middle, ${\displaystyle {\mathcal {P))_{x))$ is in bijection with ${\displaystyle 2^{x))$. See also ${\displaystyle {\mathsf {IZF))}$.

Full Separation is equivalent to just assuming that each individual subclass of ${\displaystyle 1}$ is a set. Assuming full Separation, both full Choice and Regularity prove ${\displaystyle {\mathrm {PEM} ))$.

Relatedly, assuming ${\displaystyle {\mathrm {PEM} ))$ in this theory, Set induction becomes equivalent to Regularity and Replacement becomes capable of proving full Separation.

Metalogic

While the theory ${\displaystyle {\mathsf {ECST))+{\mathrm {Exp} ))$ does not exceed the consistency strength of Heyting arithmetic, adding Excluded Middle gives a theory proving the same theorems as classical ${\displaystyle {\mathsf {ZF))}$ minus Regularity! Thus, adding Regularity as well as either ${\displaystyle {\mathrm {PEM} ))$ or full Separation to ${\displaystyle {\mathsf {ECST))+{\mathrm {Exp} ))$ gives full classical ${\displaystyle {\mathsf {ZF))}$. Adding full Choice and full Separation gives ${\displaystyle {\mathsf {ZFC))}$ minus Regularity.

So this would thus lead to a theory beyond the strength of typical type theory.

Category and type theoretic notions

So in this context with Exponentiation, function spaces are more accessible than classes of subsets, as is the case with exponential objects resp. subobjects in category theory. In category theoretical terms, the theory ${\displaystyle {\mathsf {BCST))+{\mathrm {Exp} ))$ essentially corresponds to constructively well-pointed Cartesian closed Heyting pretoposes with (whenever Infinity is adopted) a natural numbers object. Existence of powerset is what would turn a Heyting pretopos into an elementary topos. Every such topos that interprets ${\displaystyle {\mathsf {ZF))}$ is of course a model of these weaker theories, but locally Cartesian closed pretoposes have been defined that e.g. interpret theories with Exponentiation but reject full Separation and Powerset. A form of ${\displaystyle {\mathrm {PEM} ))$ corresponds to any subobject having a complement, in which case we call the topos Boolean. Diaconescu's theorem in its original topos form says that this hold iff any coequalizer of two nonintersecting monomorphisms has a section. The latter is a formulation of choice. Barr's theorem states that any topos admits a surjection from a Boolean topos onto it, relating to classical statements being provable intuitionistically.

In type theory, the expression "${\displaystyle x\to y}$" exists on its own and denotes function spaces, a primitive notion. These types (or, in set theory, classes or sets) naturally appear, for example, as the type of the currying bijection between ${\displaystyle (z\times x)\to y}$ and ${\displaystyle z\to y^{x))$, an adjunction. A typical type theory with general programming capability - and certainly those that can model ${\displaystyle {\mathsf {CZF))}$, which is considered a constructive set theory - will have a type of integers and function spaces representing ${\displaystyle {\mathbb {Z} }\to {\mathbb {Z} ))$, and as such also include types that are not countable. This is just to say, or implies, that among the function terms ${\displaystyle f\colon {\mathbb {Z} }\to ({\mathbb {Z} }\to {\mathbb {Z} })}$, none have the property of being a bijection.

Constructive set theories are also studied in the context of applicative axioms.

Analysis

In this section the strength of ${\displaystyle {\mathsf {ECST))+{\mathrm {Exp} ))$ is elaborated on. For context, possible further principles are mentioned, which are not necessarily classical and also not generally considered constructive. Here a general warning is in order: When reading proposition equivalence claims in the computable context, one shall always be aware which choice, induction and comprehension principles are silently assumed. See also the related Constructive analysis and Computable analysis.

Cauchy sequences

Exponentiation implies recursion principles and so in ${\displaystyle {\mathsf {ECST))+{\mathrm {Exp} ))$, one can comfortably reason about sequences ${\displaystyle s\colon \omega \to {\mathbb {Q} ))$, their regularity properties such as ${\displaystyle |s_{n}-s_{m}|\leq {\tfrac {1}{n))+{\tfrac {1}{m))}$, or about shrinking intervals in ${\displaystyle \omega \to ({\mathbb {Q} }\times {\mathbb {Q} })}$. So this enables speaking of Cauchy sequences and their arithmetic.

Cauchy reals

Any Cauchy real number is a collection of sequences, i.e. subset of a set of functions on ${\displaystyle \omega }$. More axioms are required to always grant completeness of equivalence classes of such sequences and strong principles need to be postulated to imply the existence of a modulus of convergence for all Cauchy sequences. Weak countable choice is generally the context for proving uniqueness of the Cauchy reals as complete (pseudo-)ordered field. The prefix "pseudo" here highlights that the order will, in any case, constructively not always be decidable.[11]

Towards the Dedekind reals

As in the classical theory, Dedekind cuts are characterized using subsets of algebraic structures such as ${\displaystyle {\mathbb {Q} ))$: The properties of being inhabited, numerically bounded above, "closed downwards" and "open upwards" are all bounded formulas with respect to the given set underlying the algebraic structure. A standard example of a cut, the first component indeed exhibiting these properties, is the representation of ${\displaystyle {\sqrt {2))}$ given by

${\displaystyle {\big \langle }\{x\in {\mathbb {Q} }\mid x<0\lor x^{2}<2\},\,\{x\in {\mathbb {Q} }\mid 0

(Depending on the convention for cuts, either of the two parts or neither, like here, may makes use of the sign ${\displaystyle \leq }$.)

The theory given by the axioms so far validates that a pseudo-ordered field that is also Archimedean and Dedekind complete, if it exists at all, is in this way characterized uniquely, up to isomorphism. However, the existence of just function spaces such as ${\displaystyle \{0,1\}^{\mathbb {Q} ))$ does not grant ${\displaystyle ((\mathcal {P))_{\mathbb {Q} ))}$ to be a set, and so neither is the class of all subsets of ${\displaystyle {\mathbb {Q} ))$ that do fulfill the named properties. What is required for the class of Dedekind reals to be a set is an axiom regarding existence of a set of subsets and this is discussed further below in the section on Binary refinement. In a context without ${\displaystyle {\mathrm {PEM} ))$ or Powerset, countable choice into finite sets is commonly assumed to prove the uncountability of the Dedekind reals.

Whether Cauchy or Dedekind reals, fewer statements about the arithmetic of the reals are decidable, compared to the classical theory.

Constructive schools

Non-constructive claims valuable in the study of constructive analysis are commonly formulated as concerning all binary sequences, i.e. functions ${\displaystyle f\colon \omega \to \{0,1\))$. That is to say claims which are now set bound via "${\displaystyle \forall (f\in 2^{\mathbb {N} })}$".

A most prominent example is the limited principle of omniscience ${\displaystyle {\mathrm {LPO} ))$, postulating a disjunctive property, like ${\displaystyle {\mathrm {PEM} ))$ at the level of ${\displaystyle \Pi _{1}^{0))$-sentences or functions. (Example functions can be constructed in raw ${\displaystyle {\mathsf {PA))}$ such that, if ${\displaystyle {\mathsf {PA))}$ is consistent, the competing disjuncts are ${\displaystyle {\mathsf {PA))}$-unprovable.) The principle is independent of e.g. ${\displaystyle {\mathsf {CZF))}$ introduced below. In that constructive set theory, ${\displaystyle {\mathrm {LPO} ))$ implies its "weaker" version, itself implying the "lesser" version, denoted ${\displaystyle {\mathrm {WLPO} ))$ and ${\displaystyle {\mathrm {LLPO} ))$. ${\displaystyle {\mathrm {LPO} ))$ moreover implies Markov's principle ${\displaystyle {\mathrm {MP} ))$, a form of proof by contradiction motivated by (unbound memory capacity) computable search, as well as the ${\displaystyle \Pi _{1}^{0))$-version of the fan theorem. Mention of such principles holding for ${\displaystyle \Pi _{1}^{0))$-sentences generally hint at equivalent formulations in terms of sequences, deciding apartness of reals. In a constructive analysis context with countable choice, ${\displaystyle {\mathrm {LPO} ))$ is e.g. equivalent to the claim that every real is either rational or irrational - again without the requirement to witness either disjunct. The three omniscience principles are each equivalent to theorems of the apartness, equality or order of two reals in this way.

Here a list of some propositions employed in theories of constructive analysis that are not provable using just base intuitionistic logic. For example, see ${\displaystyle {\mathrm {MP} ))$ or even the anti-classical constructive Church's thesis principle ${\displaystyle {\mathrm {CT} ))$ for number-theoretic functions as a postulate in the theory, or some of its consequences on the recursive mathematics side (variously called ${\displaystyle {\mathsf {RUSS))}$, ${\displaystyle {\mathsf {CRM))}$ or ${\displaystyle {\mathsf {RRCM))}$). This is discussed below. On another end, there are Kripke's schema (turning all subclasses of ${\displaystyle \omega }$ countable), bar induction, the decidable fan theorem ${\displaystyle {\mathrm {FAN} }_{\Delta ))$ (which contradicts strong forms of Church's thesis), or even Brouwer's anti-classical continuity principle determining functions on unending sequences through finite initial segments, on the Brouwerian intuitionist side (${\displaystyle {\mathsf {INT))}$). Both mentioned schools contradict ${\displaystyle {\mathrm {LPO} ))$, so that choosing to adopt certain of its laws makes the theory inconsistent with theorems in classical analysis. Those two schools are moreover not consistent with one another.

Infinite trees

Through the relation between computability and the arithmetical hierarchy, insights in this classical study are also revealing for constructive considerations. A basic insight of reverse mathematics concerns computable infinite finitely branching binary trees. Such a tree may e.g. be encoded as an infinite set of finite sets

${\displaystyle T\,\subset \,\cup _{n\in \omega }\{0,1\}^{\{0,1,\dots ,n-1\))}$,

with decidable membership, and those trees then provenly contain elements of arbitrary big finite size. The so called Weak Kőnigs lemma ${\displaystyle {\mathrm {WKL} ))$ states: For such ${\displaystyle T}$, there always exists an infinite path in ${\displaystyle \omega \to \{0,1\))$, i.e. an infinite sequence such that all its initial segments are part of the tree. In reverse mathematics, the second-order arithmetic ${\displaystyle {\mathsf {RCA))_{0))$ does not prove ${\displaystyle {\mathrm {WKL} ))$. To understand this, note that there are computable trees ${\displaystyle K}$ for which no computable such path through it exists. To prove this, one enumerates the partial computable sequences and then diagonalizes all total computable sequences in one partial computable sequences ${\displaystyle d}$. One can then roll out a certain tree ${\displaystyle K}$, one exactly compatible with the still possible values of ${\displaystyle d}$ everywhere, which by construction is incompatible with any total computable path.

In ${\displaystyle {\mathsf {CZF))}$, the principle ${\displaystyle {\mathrm {WKL} ))$ implies the non-constructive lesser limited principle of omniscience ${\displaystyle {\mathrm {LLPO} ))$. In a more conservative context, they are equivalent assuming ${\displaystyle \Pi _{1}^{0))$-${\displaystyle {\mathrm {AC} }_{\omega ,2))$ (a very weak countable choice). It is also equivalent to the Brouwer fixed point theorem and other theorems regarding values of continuous functions on the reals. The fixed point theorem in turn implies the intermediate value theorem, but be aware that the classical theorems can translate to different variants when expressed in a constructive context.[12]

The ${\displaystyle {\mathrm {WKL} ))$ concerns infinite graphs and so its contrapositive gives a condition for finiteness. Again to connect to analysis, over the classical arithmetic theory ${\displaystyle {\mathsf {RCA))_{0))$, the claim of ${\displaystyle {\mathrm {WKL} ))$ is for example equivalent to the Borel compactness regarding finite subcovers of the real unit interval. A closely related existence claim involving finite sequences in an infinite context is the decidable fan theorem ${\displaystyle {\mathrm {FAN} }_{\Delta ))$. Over ${\displaystyle {\mathsf {RCA))_{0))$, they are actually equivalent. In ${\displaystyle {\mathsf {CZF))}$ those are distinct, but, after again assuming some choice, here then ${\displaystyle {\mathrm {WKL} ))$ implies ${\displaystyle {\mathrm {FAN} }_{\Delta ))$.

Restricting function spaces

In the following short remark function and claims made about them is again meant in the sense of computability theory: The μ operator enables all partial general recursive functions (or programs, in the sense that they are Turing computable), including ones e.g. non-primitive recursive but ${\displaystyle {\mathrm {PA} ))$-total, such as the Ackermann function. The definition of the operator involves predicates over the naturals and so the theoretical analysis of functions and their totality depends on the formal framework and proof calculus at hand. This is highlighted because of the concern with axioms in theories other than arithmetic.

The predicate expressing a program to be total is famously computably undecidable. An anti-classical constructive Church's principle ${\displaystyle {\mathrm {CT} ))$, expressed in the language of the theory, concerns those set functions and it postulates that they corresponds to computable programs. The natural numbers which are thought of as indices (for the computable functions which are total) in computability theory are ${\displaystyle \Pi _{2}^{0))$ in the arithmetical hierarchy. Which is to say it is still a subclass of the naturals and so this is, when put in relation to some classical function spaces, a conceptually small class. In this sense, adopting the ${\displaystyle {\mathrm {CT} ))$ postulate makes ${\displaystyle \omega \to \omega }$ into a "sparse" set, as viewed from classical set theory. Subcountability of sets can also be postulated independently. ${\displaystyle {\mathrm {CT} ))$ is still consistent with some choice, but it contradicts classically valid principles such as ${\displaystyle {\mathrm {LLPO} ))$ and ${\displaystyle {\mathrm {FAN} }_{\Delta ))$, which are amongst the weakest often discussed principles.

Induction

Mathematical induction

In set language, induction principles can read ${\displaystyle \mathrm {Ind} (A)\to \omega \subset A}$, with the antecedent ${\displaystyle \mathrm {Ind} (A)}$ defined as further above, and with ${\displaystyle \omega \subset A}$ meaning ${\displaystyle \forall (n\in \omega ).n\in A}$ where ${\displaystyle \omega }$ is always the set of naturals. Via the strong axiom of Infinity and bounded Separation, the validity of induction for bounded definitions was already established.

At this point it is instructive to recall how set comprehension was encoding statements in predicate logic. For an example, given set ${\displaystyle y}$, let ${\displaystyle P(n)}$ denote the existential statement that a certain function space set exist, ${\displaystyle \exists x.x=y^{\{0,1,\dots ,n-1\))}$. Here the existential quantifier is not merely one over natural numbers or bounded by any other set. Now a proposition like the exponentiation claim ${\displaystyle \forall (n\in \omega ).P(n)}$ and the subclass claim ${\displaystyle \omega \subset \{n\in \omega \mid P(n)\))$, are just two ways of formulating the same desired claim, namely an ${\displaystyle n}$-indexed conjunction of existential propositions where ${\displaystyle n}$ spans over the set of all naturals. The second form is expressed using class notation involving a subclass comprehension that may not constitute a set, in which case many set axioms won't apply, so that establishing it as a theorem may not be possible. A set theory with just bounded Separation can thus also be strengthened by adopting arithmetical induction schemas for predicates beyond just the bounded ones.

The iteration principle for set functions mentioned in the section dedicated to arithmetic is also implied by the full induction schema over one's structure modeling the naturals (e.g. ${\displaystyle \omega }$). So for that theorem, granting a model of Heyting arithmetic, it represents an alternative to Exponentiation. The schema is often formulated in terms of predicates as follows:

 Axiom schema of full mathematical induction: For any predicate ${\displaystyle \phi }$ on ${\displaystyle \omega }$, ${\displaystyle {\Big (}\phi (0)\ \land \ \forall (k\in \omega ).{\big (}\phi (k)\to \phi (Sk){\big )}{\Big )}\to \forall (n\in \omega ).\phi (n)}$

Here the 0 denotes ${\displaystyle \{\))$ as above, and the set ${\displaystyle Sn}$ denotes the successor set of ${\displaystyle n\in \omega }$, with ${\displaystyle n\in Sn}$. By Axiom of Infinity above, it is again a member of ${\displaystyle \omega }$.

The full induction schema is implied by the full Separation schema. As elaborated in the section on induction from infinity, here formulas in schemas are to be understood as formulas in first-order set theory. And as stated in the section on Choice, induction principles are also implied by various forms of choice principles.

Set Induction

Full Set Induction in ${\displaystyle {\mathsf {ECST))}$ proves induction in transitive sets and so transitive sets or transitive sets (ordinals). This enables ordinal arithmetic. In particular, it proves full mathematical induction. Replacement is not required to prove induction over the set of naturals, but it is for their arithmetic modeled within the set theory.

 Axiom schema of Set induction: For any predicate ${\displaystyle \phi }$, ${\displaystyle {\Big (}\forall x.\,{\big (}\forall (y\in x).\ \phi (y){\big )}\to \phi (x){\Big )}\to \forall z.\phi (z)}$

Here ${\displaystyle \forall (z\in \{\}).\phi (z)}$ holds trivially and so this covers to the "bottom case" ${\displaystyle \phi (\{\})}$ in the standard framework. The variant of the axiom just for bounded formulas is also studied independently and may be derived from other axioms.

The axiom allows definitions of class functions by transfinite recursion. The study of the various principles that grant set definitions by induction, i.e. inductive definitions, is a main topic in the context of constructive set theory and their comparatively weak strengths. This also holds for their counterparts in type theory.

The axiom of regularity is a single statement with universal quantifier over sets and not a schema. As show, it implies ${\displaystyle {\mathrm {PEM} ))$, and so is non-constructive. Now for ${\displaystyle \phi }$ taken to be the negation of some predicate ${\displaystyle \neg S}$ and writing ${\displaystyle \Sigma }$ for the class ${\displaystyle \{y\mid S(y)\))$, induction reads

${\displaystyle \forall (x\in \Sigma ).x\cap \Sigma \neq \{\}\,\to \,\Sigma =\{\))$

Via the contrapositive, set induction implies all instances of regularity but only with double-negated existence in the conclusion. In the other direction, given enough transitive sets, regularity implies each instance of set induction.

Metalogic

This now covers variants of all of the eight Zermelo–Fraenkel axioms. Extensionality, Pairing, Union and Replacement are indeed identical. Infinity is stated in a strong formulation and implies Emty Set, as in the classical case. Separation, classically stated redundantly, is constructively not implied by Replacement. Without the Law of Excluded Middle, the theory here is lacking, in its classical form, full Separation, Powerset as well as Regularity. Adding ${\displaystyle {\mathrm {PEM} ))$ at this point would already give ${\displaystyle {\mathsf {ZF))}$. Replacement and Exponentiation can be further strengthened without losing a type theoretical interpretation and in a way that is not going beyond ${\displaystyle {\mathsf {ZF))}$. Those two alterations are discussed next.

Like the axiom of regularity, set induction restricts the possible models of the membership relation "${\displaystyle \in }$" and thus that of a set theory, as was the motivation for the principle in the 20's. The added proof-theoretical strength attained with Induction in the constructive context is significant, even if dropping Regularity in the context of ${\displaystyle {\mathsf {ZF))}$ does not reduce the proof-theoretical strength. Aczel was also one of the main developers or Non-well-founded set theory, which rejects this last axiom.

Strong Collection

Having discussed all the weakened form of axioms of ${\displaystyle {\mathsf {ZF))}$, one can reflect upon the strength of the axiom of replacement, also in the context of the classical set theory. For any set ${\displaystyle y}$ and any natural ${\displaystyle n}$, there exists the product ${\displaystyle y^{n))$ recursively given by ${\displaystyle y^{n-1}\times y}$, which have ever deeper rank. Induction for unbound predicates proves that these sets exist for all of the infinitely many naturals. Replacement "for ${\displaystyle n\mapsto y^{n))$" now moreover states that this infinite class of products can be turned into the infinite set, ${\displaystyle \{p\mid \exists (n\in \omega ).p=y^{n}\))$. This is also not a subset of any previously established set.

Going beyond those axioms also seen in Myhill's typed approach, consider the discussed constructive theory with Exponentiation and Induction, but now strengthened by the collection schema. This is an alternative to the Replacement schema and indeed supersedes it, due to not requiring the binary relation definition to be functional, but possibly multi-valued. The principle may be used in the constructive study of larger sets beyond the everyday need of analysis.

 Axiom schema of Strong Collection: For any predicate ${\displaystyle \phi }$, ${\displaystyle \forall a.\ \ {\Big (}\forall (x\in a).\exists y.\phi (x,y){\Big )}\to \exists b.{\Big (}\forall (x\in a).\exists (y\in b).\phi (x,y)\ \land \ \forall (y\in b).\exists (x\in a).\phi (x,y){\Big )))$

The axiom concerns a property for relations, giving rise to a somewhat repetitive format in its first-order formulation. The antecedent states that one considers relation ${\displaystyle \phi }$ between sets ${\displaystyle x}$ and ${\displaystyle y}$ that are total over a certain domain set ${\displaystyle a}$, that is, ${\displaystyle \phi }$ has at least one "image value" ${\displaystyle y}$ for every element ${\displaystyle x}$ in the domain. This is more general than an inhabitance condition ${\displaystyle x\in y}$ in a choice axiom, but also more general than the condition of Replacement, which demands unique existence ${\displaystyle \exists !y}$. In the consequent, firstly, the axioms states that then there exists a set ${\displaystyle b}$ which contains at least one "image" value ${\displaystyle y}$ under ${\displaystyle \phi }$, for every element of the domain. Secondly, in this axioms formulation it then moreover states that only such images ${\displaystyle y}$ are elements of that new codomain set ${\displaystyle b}$. It is guaranteeing that ${\displaystyle b}$ does not overshoot the codomain of ${\displaystyle \phi }$ and thus the axiom is also expressing some power akin to a Separation procedure. The axiom may be expressed as saying that for every total relation, there exists a set ${\displaystyle b}$ such that the relation is total in both directions.

Metalogic

This theory without ${\displaystyle {\mathrm {PEM} ))$, without unbounded separation and without "naive" Power set enjoys various nice properties. For example, as opposed to ${\displaystyle {\mathsf {CZF))}$ with its subset collection schema below, it has the existence property.

Constructive Zermelo–Fraenkel

Subset Collection

One may approach Power set further without losing a type theoretical interpretation. The theory known as ${\displaystyle {\mathsf {CZF))}$ is the axioms above plus a stronger form of Exponentiation. It is by adopting the following alternative, which can again be seen as a constructive version of the Power set axiom:

 Axiom schema of Subset Collection: For any predicate ${\displaystyle \phi }$, ${\displaystyle \forall a.\forall b.\ \ \exists u.\forall z.{\big (}\forall (x\in a).\exists (y\in b).\phi (x,y,z){\big )}\to \exists (v\in u).{\big (}\forall (x\in a).\exists (y\in v).\phi (x,y,z)\;\land \;\forall (y\in v).\exists (x\in a).\phi (x,y,z){\big )))$

An alternative that is not a schema is elaborated on below.

Fullness

For given ${\displaystyle a}$ and ${\displaystyle b}$, let ${\displaystyle {\mathcal {R))_{ab))$ be the class of all total relations between ${\displaystyle a}$ and ${\displaystyle b}$. This class is given as

${\displaystyle r\in {\mathcal {R))_{ab}\leftrightarrow {\Big (}{\big (}\forall (x\in a).\exists (y\in b).\langle x,y\rangle \in r{\big )}\,\land \,{\big (}\forall (p\in r).\exists (x\in a).\exists (y\in b).p=\langle x,y\rangle {\big )}{\Big )))$

As opposed to the function definition, there is no unique existence quantifier in ${\displaystyle \exists !(y\in b)}$. The class ${\displaystyle {\mathcal {R))_{ab))$ represents the space of "non-unique-valued functions" or "multivalued functions" from ${\displaystyle a}$ to ${\displaystyle b}$, but as set of individual pairs with right projection in ${\displaystyle b}$, and only those.

One does not postulate ${\displaystyle {\mathcal {R))_{ab))$ to be a set, since with Replacement one can use this collection of relations between a set ${\displaystyle a}$ and the finite ${\displaystyle b=\{0,1\))$, i.e. the "bi-valued functions on ${\displaystyle a}$", to extract the set ${\displaystyle {\mathcal {P))_{a))$ of all its subsets. In other words ${\displaystyle {\mathcal {R))_{ab))$ being a set would imply the Powerset axiom.

Over ${\displaystyle {\mathsf {ECTS))+{\text{Strong Collection))}$, there is a single, somewhat clearer alternative axiom to the Subset Collection schema. It postulates the existence of a sufficiently large set ${\displaystyle {\mathcal {S))_{ab))$ of total relations between ${\displaystyle a}$ and ${\displaystyle b}$.

 Axiom of Fullness: ${\displaystyle \forall a.\forall b.\ \exists {\mathcal {S))_{ab}.\ ({\mathcal {S))_{ab}\subset {\mathcal {R))_{ab})\land \forall (r\in {\mathcal {R))_{ab}).\exists (s\in {\mathcal {S))_{ab}).s\subset r}$

This says that for any two sets ${\displaystyle a}$ and ${\displaystyle b}$, there exists a set ${\displaystyle {\mathcal {S))_{ab}\subset {\mathcal {R))_{ab))$ which among its members inhabits a still total relation ${\displaystyle s\in {\mathcal {S))_{ab))$ for any given total relation ${\displaystyle r\in {\mathcal {R))_{ab))$.

On a given domain ${\displaystyle a}$, the functions are exactly the sparsest total relations, namely the unique valued ones. Therefore, the axiom implies that there is a set such that all functions are in it. In this way, Fullness implies Exponentiation. The Fullness axiom is in turn also implied by the so-called Presentation Axiom about sections, which can also be formulated category theoretically.

Binary refinement

The so called binary refinement axiom says that for any ${\displaystyle a}$ there exists a set ${\displaystyle {\mathcal {B))_{a}\subset {\mathcal {P))_{a))$ such that for any covering ${\displaystyle a=x\cup y}$, the set ${\displaystyle {\mathcal {B))_{a))$ holds two subsets ${\displaystyle c\subset x}$ and ${\displaystyle d\subset y}$ that also do this covering job, ${\displaystyle a=c\cup d}$. It is a weakest form of the powerset axiom and at the core of some important mathematical proofs. Fullness for relations between the set ${\displaystyle a}$ and the finite ${\displaystyle \{0,1\))$ implies that this is indeed possible.

Taking another step back, ${\displaystyle {\mathsf {ECST))}$ plus Recursion and plus Binary refinement already proves that there exists an Archimedean, Dedekind complete pseudo-ordered field. That set theory also proves that the class of left Dedekind cuts is a set, not requiring Induction or Collection. And it moreover proves that function spaces into discrete sets are sets (there e.g. ${\displaystyle \omega \to \omega }$), without assuming ${\displaystyle {\mathrm {Exp} ))$. Already over the weak theory ${\displaystyle {\mathsf {BCST))}$ (which is to say without Infinity) does binary refinement prove that function spaces into discrete sets are sets, and therefore e.g. the existence of all characteristic function spaces ${\displaystyle \{0,1\}^{a))$.

Unprovable claims

The bounded notion of a transitive sets of transitive sets is a good way to define ordinals and enables induction on ordinals. With this, in ${\displaystyle {\mathsf {CZF))}$, assuming that membership of ${\displaystyle 0}$ is decidable in all successor ordinals ${\displaystyle S\alpha }$ proves ${\displaystyle {\mathrm {PEM} ))$ for bounded formulas. Also, neither linearity of ordinals, nor existence of power sets of finite sets are derivable in this theory, as assuming either implies Power set. The theory ${\displaystyle {\mathsf {CZF))}$ does not prove that all function spaces formed from sets in the constructible universe ${\displaystyle L}$ are sets inside ${\displaystyle L}$, and this holds even when assuming Powerset instead of the weaker Exponentiation axiom. So such theories do not prove ${\displaystyle L}$