ST type theory

The following system is Mendelson's (1997, 289–293) ST type theory.
ST is equivalent with Russell's ramified theory plus the Axiom of reducibility.
The domain of quantification is partitioned into an ascending hierarchy of types, with all individuals assigned a type. Quantified variables range over only one type; hence the underlying logic is first-order logic. ST is "simple" (relative to the type theory of ''Principia Mathematica'') primarily because all members of the domain and codomain of any relation must be of the same type.
There is a lowest type, whose individuals have no members and are members of the second lowest type. Individuals of the lowest type correspond to the urelements of certain set theories. Each type has a next higher type, analogous to the notion of successor in Peano arithmetic. While ST is silent as to whether there is a maximal type, a transfinite number of types poses no difficulty. These facts, reminiscent of the Peano axioms, make it convenient and conventional to assign a natural number to each type, starting with 0 for the lowest type. But type theory does not require a prior definition of the naturals.

The symbols peculiar to ST are primed variables and infix operator $\in$. In any given formula, unprimed variables all have the same type, while primed variables ($x'$) range over the next higher type. The atomic formulas of ST are of two forms, $x=y$ (identity) and $y\in x'$. The infix-operator symbol $\in$ suggests the intended interpretation, set membership.

All variables appearing in the definition of identity and in the axioms ''Extensionality'' and ''Comprehension'', range over individuals of one of two consecutive types. Only unprimed variables (ranging over the "lower" type) can appear to the left of '$\in$', whereas to its right, only primed variables (ranging over the "higher" type) can appear. The first-order formulation of ST rules out quantifying over types. Hence each pair of consecutive types requires its own axiom of Extensionality and of Comprehension, which is possible if ''Extensionality'' and ''Comprehension'' below are taken as axiom schemata "ranging over" types.

* Identity, defined by x=y\leftrightarrow\forall z' \in z'\leftrightarrow y\in z'/math>.
* Extensionality. An axiom schema. \forall x \in y' \leftrightarrow x\in z'\rightarrow '=z'/math>.

Let $\Phi(x)$ denote any first-order formula containing the free variable $x$.

* Comprehension. An axiom schema. \exists z'\forall x \in z'\leftrightarrow \Phi(x)/math>.

: ''Remark''. Any collection of elements of the same type may form an object of the next higher type. Comprehension is schematic with respect to $\Phi(x)$ as well as to types.

* Infinity. There exists a nonempty binary relation $R$ over the individuals of the lowest type, that is irreflexive, transitive, and strongly connected: \forall x,y \neq y\rightarrow[xRy\vee yRx and with codomain contained in domain.

: ''Remark''. Infinity is the only true axiom of ST and is entirely mathematical in nature. It asserts that $R$ is a strict total order, with a codomain contained in its domain. If 0 is assigned to the lowest type, the type of $R$ is 3. Infinity can be satisfied only if the (co)domain of $R$ is infinite, thus forcing the existence of an infinite set. If relations are defined in terms of ordered pairs, this axiom requires a prior definition of ordered pair; the Kuratowski definition, adapted to ST, will do. The literature does not explain why the usual axiom of infinity (there exists an inductive set) of ZFC of other set theories could not be married to ST.

ST reveals how type theory can be made very similar to axiomatic set theory. Moreover, the more elaborate ontology of ST, grounded in what is now called the "iterative conception of set," makes for axiom (schemata) that are far simpler than those of conventional set theories, such as ZFC, with simpler ontologies. Set theories whose point of departure is type theory, but whose axioms, ontology, and terminology differ from the above, include New Foundations and Scott–Potter set theory.

Formulations based on equality

Church's type theory has been extensively studied by two of Church's students, Leon Henkin and Peter B. Andrews. Since ST is a higher order logic, and in higher order logics one can define propositional connectives in terms of logical equivalence and quantifiers, in 1963 Henkin developed a formulation of ST based on equality, but in which he restricted attention to propositional types. This was simplified later that year by Andrews in his
theory Q₀. In this respect ST can be seen as a particular kind of a higher-order logic, classified by P.T. Johnstone in ''Sketches of an Elephant'', as having a lambda-signature, that is a higher-order signature that contains no relations, and uses only products and arrows (function types) as type constructors. Furthermore, as Johnstone put it, ST is "logic-free" in the sense that it contains no logical connectives or quantifiers in its formulae.P.T. Johnstone, ''Sketches of an elephant'', p. 952

See also

* Type theory

References

*Mendelson, Elliot, 1997. ''Introduction to Mathematical Logic'', 4th ed. Chapman & Hall.
*W. Farmer, ''The seven virtues of simple type theory'', Journal of Applied Logic, Vol. 6, No. 3. (September 2008), pp. 267–286.

{{Reflist, 30em

Type theory