A set of formulas in a Language is sufficiently strong if proves the Absoluteness of all relevant formulas. Lemma For finitely many relevant formulas, we can always find a finite sufficiently strong . Proof If proves the Absoluteness of , then by Compactness Theorem there is a finite that does.