The incompleteness of ZF set theory leads one to look for natural extensions of ZF in which one can prove statements independent of ZF which appear to be “true”. One approach has been to add large cardinal axioms. Or, one can investigate second-order expansions like Kelley-Morse class theory, KM. In this paper we look at a set theory ZF(aa), with an added quantifier aa which ranges over ordinals. The “aa” stands for “almost all”, and although we will consider interpretations in terms of the closed unbounded filter on a regular cardinal κ, we will consider other interpretations also. We start in §1 by giving the axioms for the theory ZF(aa) and presenting a completeness theorem which gives a model-theoretic definition of ZF(aa). In §2 we investigate set theory with a satisfaction predicate and interpret it in a fragment of ZF(aa). In §3 we generalize the methods of §2 to obtain a hierarchy of satisfaction predicates. We use these predicates to prove reflection theorems, as well as to prove the consistency of certain fragments of ZF(aa). Next, in §4 we discuss expandability of models of ZF to models of fragments of ZF(aa) and of Kelley-Morse. We conclude in §5 with a discussion of an extension ZF(aa) + DET of ZF(aa) in which the quantifier aa is self-dual.
[1]
S. Shelah.
Generalized quantifiers and compact logic
,
1975
.
[2]
James E. Baumgartner.
Ineffability Properties of Cardinals II
,
1977
.
[3]
Chen C. Chang,et al.
Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics
,
1966
.
[4]
Roman Murawski.
On expandability of models of Peano arithmetic. III
,
1976
.
[5]
W. Marek,et al.
On extendability of models of ZF set theory to the models of Kelley-Morse theory of classes
,
1975
.
[6]
Urlich Felgner,et al.
Comparison of the axioms of local and universal choice
,
1971
.
[7]
Yuzuru Kakuda.
Set Theory Based on the Language with the Additional Quantifier ""for almost all"" (I)
,
1980
.
[8]
Paul C. Eklof,et al.
Stationary logic of finitely determinate structures
,
1979
.
[9]
A. Macintyre,et al.
Ramsey quantifiers in arithmetic
,
1980
.
[10]
John S. Schlipf,et al.
A guide to the identification of admissible sets above structures
,
1977
.
[11]
James H. Schmerl.
On κ-like structures which embed stationary and closed unbounded subsets
,
1976
.
[12]
R. Montague,et al.
Natural models of set theories
,
1959
.