A sufficient syntactic condition is that be a sigma-one formula in set theory, written : an existential block with bounded, meaning that each of its quantifiers is of the form or . A bounded formula is also called and is absolute in both directions between transitive classes.
Prove the latter fact by structural induction. Atomic membership and equality have their actual meanings in both classes, and Boolean connectives preserve equivalence of truth. For a bounded quantifier with bound , transitivity ensures that every element of belongs to ; thus its range is exactly the same in both classes, and induction applies to its matrix. This proves the bounded case. If the smaller class satisfies a formula, take its existential witnesses in . They remain available in , and bounded absoluteness preserves the matrix. Hence formulas are upward absolute. An arbitrary unbounded universal quantifier has no such witness-preservation argument.

Articles by others on the same topic (0)

There are currently no matching articles.