We showed that formulas are absolute among transitive models of (enough) set theory, and used this to prove that satisfiability for transitive sets is absolute. More precisely, let mean that is a transitive set , codes a formula , is a tuple of elements of , and . Then is . Using this and the reflection theorem we can conclude that is actually the extent of absoluteness in set theory, meaning that whenever there is a finite such that is absolute for transitive models of , then is .
We exhibited a few formulas that are not absolute. For example, “ is a cardinal” and “,” although both are and therefore relativize downwards.
The main application of the absoluteness of satisfiability is that it allows us to define the constructible hierarchy and Gödel’s constructible universe .
Remark. On the other hand, we cannot define in general satisfiability for transitive classes, by Tarski’s undefinability of truth theorem. The difference with the case of sets is that with sets the recursive definition of involves several bounded quantifiers, ranging over finite powers of . With general proper classes , these quantifiers would be unbounded. An easy inductive argument shows that we can define partial satisfiability predicates (and therefore partial truth predicates), meaning that for each natural number and each class we can find a formula that defines satisfiability for formulas with respect to ; although we cannot in general find a uniform definition that works simultaneously for all .