Notes on Cambridge Maths

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Sufficiently Strong

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

It proves the Absoluteness of ,
then by Compactness Theorem there is a finite that does.

Something looks off?

The button will add this page to my log of things to fix. Use it for broken links, equations not rendering correctly, etc.
Submit other issues on GitHub.

Graph View

Backlinks