7 Łoś’s Theorem and Consequences
Question, how does
relate to ?
Theorem 7.1 (Los Lemma).
Assuming that:
Proof (sketch).
Induction on
-
Complexity of terms
-
Formulas
(essentially Proposition 5.8). □
Corollary 7.2.
Assuming that:
Then if
and only if .
Theorem 7.3 (Compactness – ultraproduct proof).
Assuming that:
-
a language
-
a set of -sentences
Then is consistent if and
only if every finite subset of
is consistent.
Proof.
-
Clear.
-
Assume every finite subset of
is consistent. Let be the
set of all finite subsets of .
For each ,
let
Let ĵ
and let
Exercise:
is a filter.
Let
be an ultrafilter extending .
For each ,
let .
Let .
Claim: .
Let .
Then
and .
So ,
so .
So: .
□