ASC: Atoms, Sets and Classes.

The following "second-order" axiom system is one I've been thinking about for a couple of years. It is called ASC, which stands for "atoms, sets and classes". In a sense, it is the bottom level of Morse-Kelley class theory with atoms, MKA. A set is defined to be a class which is a member of some class. Specific set existence axioms are then given in the usual second-order way.

The formulation of ASC is modelled partly on Mendelson's formulation of NBG set theory in
Mendelson, Introduction to Mathematical Logic, Chapter 4, "Axiomatic Set Theory".
except that (Impredicative) Class Comprehension is assumed as an axiom (scheme). The official language L of ASC is a 1-sorted first-order language, with variables X,Y,Z,X1,X2, and three primitive predicates:
X=Y for "X is identical to Y"
XY for "X is an element of Y"
Cl(X) for "X is a class"
We introduce explicit definitions:
Memb(X) is short for Y(XY).
Atom(X) is short for ¬Cl(X)Memb(X).
Then:
Axioms of ASC:
(COMP) X[Cl(X)Y(YX(Memb(Y)ϕ(Y))].
(EXT) Cl(X)Cl(Y)(Z(ZXZY)X=Y).
(ATOM) Atom(X)Y(YX).
These are restricted class comprehension, extensionality and an axiom saying that atoms are empty:

To simplify notation, one may introduce a new variable sort x,y,z, as follows:
xϕ(x) is short for X(Memb(X)ϕ(X))
So, that comprehension can be re-expressed in the more familiar "second-order" way:
(COMP) X(Cl(X)y(yXϕ(y))).
Extensionality allows us to prove the uniqueness of any such class; and so we can form class abstracts:
{xϕ(x)}
with the usual meaning (i.e., the class of all members x such that ϕ(x)), whose existence is guaranteed by (COMP).

This "second-order" theory ASC is very safe: it has 1-element models! For example, let the L-interpretation A be defined by:
A={0}
A=
ClA={0}
Then:
AASC
set is defined to be a class which is a member. That is,
Set(X) is short for Cl(X)Memb(X)
The theory ASC proves the existence of the class , but does not prove that is a set. Similarly, given X,YASC proves the existence of the class {X,Y}, but does not prove that {X,Y} is a set. One can remedy this with specific set-existence existence axioms, such as:
(Empty)  is a set.
(Pair) If x,y are members, then {x,y} is a set.
And one can then continue to add one's favourite set existence axioms.

Comments