We prove that if
such that
where
Sufficiently Strong
Absoluteness of Truth in a Model
Proof
Let
We want to prove that
Any Transitive Model satisfies Axiom of Extensionality and Axiom of Foundation.
Also
we also get
The operations
for a Sufficiently Strong
So we only need to prove
Find
Assume
Take some
Consider:
Form
The union is exactly the same.
Now we consider the Power-set axiom
This is more complicated, because it is not Absolute.
(But if it was absolute, it would be hopeless to find a powerset in a countable model)
Note that
Thus if
Also clearly
Thus our candidate is
If
Define
By Axiom of Replacement this is a set,
and it is a set of ordinals, so it has to have an upper bound
so there is some
so
Let
then
Now consider Axiom of Separation.
We need the set
where
Take formula
Then
This only works if
Apply Lévy Reflection Theorem to find
such that
Thus
and so separation holds.
Axiom of Replacement is on Example Sheet 2.
The only one left is the Axiom of Choice
We can provide a well-order of
Fix some some
Assume that
define lexifcographically a wellorder of
and then write for
Make this into an end-extension of
Thus
is a well-order of
However, this was a recursive definition so its Absolute so:
and in particular Axiom of Choice holds in
Axiom of Constructibility
Gödel’s Incompleteness Theorems
Gödel’s Condensation Lemma
Claim
For every
THIS PROVES CH