Take the formula saying that a set is transitive:This is a bounded formula in set theory. If , transitivity of ensures that every and every is already in , and the same holds in . Both structures therefore run through exactly the same bounded witnesses and use the same actual membership relation. They agree on for every , proving set-theoretic absoluteness.
Let be the formula expressing cardinal number status:Ordinalhood and the assertion that a given set is a bijection between fixed sets are each expressible by a bounded formula in set theory. If regarded as a non-cardinal ordinal, a witnessing smaller ordinal and bijection would remain present and valid in . Ordinalhood itself is absolute between the transitive models. Thus implies : this is downward absoluteness of cardinalhood.
For failure in the other direction, put . This ordinal belongs to , and with . Externally is countable, since and is countable. By the construction of , it contains a countability witness for , and hence a bijection . Therefore . This formula is downward absolute and fails to be upward absolute.
Use the cardinalhood formula from part (b), and let a finite flag choose between it and its negation:Here abbreviate their parameter-free definitions as Finite von Neumann ordinals, and both belong to . This is one first-order formula with two free variables.
For , part (b) proved and . The shared parameters therefore make true in and false in , disproving upward set-theoretic absoluteness. The shared parameters make it false in and true in , disproving downward set-theoretic absoluteness. Hence the same formula fails both directions, with explicit witnesses to each failure.
Articles by others on the same topic
There are currently no matching articles.