sentences:  In particular, any sentence of Peano arithmetic is absolute to transitive models of set theory with the same ordinals.Thus it is not possible to use forcing to change the truth value of arithmetical sentences, as forcing does not change the ordinals of the model to which it is applied.Many famous open problems, such as the Riemann hypothesis and the P = NP problem, can be expressed as formula_1 sentences (or sentences of lower complexity), and thus cannot be proven independent of ZFC by forcing.