The von Neumann hierarchy isEvery level is transitive, the levels are increasing, and every set belongs to some level.
If is a countable ordinal and , then must be a limit ordinal. Choose a countable cofinal sequence in . The internal axiom of choice gives, for every , a bijection between and some ordinal below ; that ordinal is externally countable, so every is countable. Hence is countable. But contains the full power set , which is uncountable by Cantor theorem, a contradiction.
For every finite collection of first-order formulas, there are arbitrarily large ordinals such that, for every and all parameters in ,The reflecting ordinals for form a closed unbounded class.
For inaccessible and any predicate , the ordinals with form a club. Closure under ranks of existential witnesses gives unboundedness, and the elementary chain theorem gives closedness.
A finite collection of first-order formulas has a closed unbounded class of ordinals whose levels in a definable continuous hierarchy agree with its union for all parameters in the level. Close the collection under subformulas, bound the least witness levels for existential instances on each set-sized stage by Axiom schema of replacement, and iterate these bounds countably. Continuity supplies the closed stages, and induction on formulas proves agreement. The Tarski-Vaught test describes the same witness criterion. For a hierarchy of length an uncountable regular cardinal, bounds stay below that cardinal when every stage has smaller cardinality.
A first-order formula describes an ordinal when is the least ordinal such that . No strongly inaccessible cardinal can be described: if , the Lévy reflection theorem produces some with .
Articles by others on the same topic
There are currently no matching articles.