Slight Reformulation of ASC

This is a slightly different formulation of the theory of classes and atoms, ASC ("atoms, sets and classes") that I rather like, because of its generality (it permits urelemente/atoms and has impredicative comprehension) and its minimal restrictions. It is closely related to MKA, Morse-Kelley class theory with atoms.

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"
Class(X) for "X is a class"
We introduce explicit definitions:
Memb(X) is short for Y(XY).
Set(X) is short for Class(X)Memb(X).
Atom(X) is short for ¬Class(X)Memb(X).
XY is short for Z(ZXZY).
In quantifiers, it's convenient to use somewhat type-theoretic looking abbreviations:
X:Class for Class(X).
X:Memb for Memb(X).
X:Atom for Atom(X).
For quantification over members, one may introduce a new variable sort x,y,z, as follows:
xϕ(x) is short for (X:Memb)ϕ(X))
Then the axioms look a bit prettier:
Axioms of ASC:
(COMP) (X:Class)y(yXϕ(y)).
(EXT) (X:Class)(Y:Class)(XYX=Y).
(ATOM) (X:Atom)Y(YX).
These are impredicative class comprehension (restricted to members), extensionality (restricted to classes) and an axiom saying that atoms are empty. One may write down any formula ϕ(y) for comprehension (with X not free of course!). Consistency of comprehension (COMP) is ensured because the inner quantification only goes over members.

As mentioned before, this "second-order" theory ASC of classes is very weak. It has 1-element models. More generally, the models are related to power-set Boolean algebras, analogous to how models for MK can be understood as P(Vα), with α inaccessible.

Comments