In a model of ZFC, choose an external automorphism and an ordinal with . Set for integer , and declare the sets of type to be its objects that are subsets of . Ordinary membership between successive types satisfies typed comprehension and set-extensionality. The automorphism shifts all types, yielding NFU by the type-zero collapse. A Skolem hull of integer-indexed increasing ordinal indiscernibles supplies such a by shifting the indices. The model is externally ill-founded; a transitive well-founded universe cannot have such an automorphism.
Let be a membership structure satisfying extensionality and every pure-membership separation instance, with an external automorphism and domains represented by objects of . Suppose every -subset of is an element of . Interpret NFU on the objects of using the displayed set predicate and membership, with all subset statements evaluated in . Atoms have no members, and extensionality applied to gives extensionality for sets. A stratified formula becomes an ordinary pure-membership formula by sending each variable of type to and restricting its quantifier to . A set predicate on sort means containment in ; adjacent-sort membership is guarded by containment in the lower domain. Separation yields the extension , the closure hypothesis places it in , and is the required untyped set. This proves every comprehension instance. The guard is essential: an object not contained in a lower domain can still have some ordinary members there, which must not become members of a typed atom. Internal ranks with give one instance of these hypotheses; shifted rank objects in an elementary model of an expanded give a consistency proof without assuming Con(ZFC).
NFU has a unary predicate for sets, atoms have no members, extensionality applies to sets, and comprehension applies to every stratified formula. A stratification assigns integer types to variables so that equality uses equal types and requires . A unary set predicate adds no type difference.
Start with the actual set structure . This structure satisfies extensionality and every pure-membership separation instance: the subset defined in a set of rank below still has rank below . We do not assert that satisfies replacement or all of ZFC. Expand it by Skolem functions. In it use the sequence of rank objects , . For two such objects in sequence order, we havewith quantifiers in . The second statement holds because every subset of belongs to , and the later rank is at least .
Introduce constants , , and require them to be order indiscernibles in the Skolem language, satisfying these two assertions whenever . Also require for every ; this fixed rank object is first-order definable in . Every finite part of these requirements together with is satisfiable: color finite increasing tuples of the original rank sequence by the truth values of the finitely many formulas mentioned, and use Ramsey's theorem to get a homogeneous subsequence. The rank assertions hold for every increasing tuple there. The compactness theorem gives a model of the full theory. In its Skolem hull generated by the , the integer shift extends to an automorphism with , by the term-transport proof of the Ehrenfeucht-Mostowski theorem. Thus still satisfies extensionality and all pure-membership separation instances, andThis is a set-sized first-order model; no satisfaction predicate for a proper-class universe is being assumed.
Externally let . The automorphism bijects onto . Interpret a typed structure with sort equal to . At sort , declare a set exactly when ; otherwise it is an atom. Define adjacent-sort membership byThe guard is necessary: a typed atom might have some ordinary -members in , and those must not become its typed members. Set-extensionality follows from extensionality in , because the ordinary members of a typed set all lie in . For any typed formula on sort , its quantifiers can be restricted to the corresponding , its set predicates replaced by subset assertions, and its memberships replaced by the guarded relation. This is an ordinary pure-membership formula of with finitely many parameters. Separation gives its extension , and the displayed closure assertion gives . It is therefore a typed set witnessing comprehension. The automorphism shifts these sorted domains and preserves the set flags and guarded memberships.
Collapse the types onto . DefineObjects not satisfying have no -members. If two sets have the same -members, their images under are subsets of with the same ordinary members, so are equal by extensionality of ; injectivity of gives equality of the original objects.
To verify every stratified comprehension instance, assign a variable its stratification type and translate its value to . Equality is preserved. An atomic translates to the guarded adjacent-sort membership because ; the unary predicate translates to . Induction on formulas, using the domain bijections for quantifiers, preserves truth. If the free variable has type , typed comprehension produces its extension , with . Put . Then holds, and for every ,This is exactly the required NFU set. No formula containing the external automorphism has been used in a separation or comprehension scheme; only transports values after the pure formula is formed.
The construction also permits the usual infinity requirement. The ordinary and its successor graph are definable in , hence fixed by , and lie below , so belong to all the required domains. Under , the members of are still its ordinary -members. The new Kuratowski pair satisfiesSince , membership of this pair in under is equivalent to . Thus is an internal injection of into itself omitting zero, giving a Dedekind-infinite set.
Articles by others on the same topic
There are currently no matching articles.