A first-order formula is if ZF proves it equivalent, with the same free variables, to a universal unbounded quantifier block followed by a bounded formula in set theory. Bounded quantifiers do not increase its level in the Lévy hierarchy. Such properties are downward absolute between appropriate transitive models of ZF.
An infinite cardinal number is a regular cardinal if every function from an ordinal into has bounded range. Write this as . The graph predicates are bounded formulas in set theory, and cardinalhood is Pi-one definable, so adding infinite cardinalhood yields a Pi-one formula modulo ZF.
An ordinal is a cardinal number precisely when no smaller ordinal has a bijection onto it. Ordinalhood and the graph predicate for a bijection are bounded formulas in set theory, so is a Pi-one formula modulo ZF. This does not assert that every set can be assigned an ordinal cardinal without the axiom of choice.
Articles by others on the same topic
There are currently no matching articles.