1 Complete Theories

Definition 1.1 (T models a sentence). Let T be an L-theory, φ an L-sentence. Then Tφ if every model of T is a model of φ.

Example. (x=x).

Tgroupsxyz((xy=exz=e)y=z).

Definition 1.2 (Complete theory). An L-theory T is complete if for every L-sentence φ, either Tφ or T¬φ.

Example 1.3. Tgroups is not complete, as (for example) it doesn’t imply xy(x+y=y+x) or ¬xy(x+y=y+x).

Definition 1.4 (Theory of M). Let M be an L-structure. Then the theory of M

ThL(M)={φ:φ is an L-sentence, and Mφ}.

(can be written Th(M) when L is clear).

Remark 1.5. ThL(M) is always complete.

Definition 1.6 (Elementarily equivalent). Two L-structures are elementarily equivalent if their theories are equal.

Given L-structures M,N, we write MLN to mean ThL(M)=ThL(N).

Note. This is an equivalence relation on L-structures.

Exercise: Let T be an L-theory. Then the following are equivalent:

Example 1.7. Let L= and Tsets={φn:n2}, where

φn=x1xnijxixj.

This forms the theory of infinite sets. Any infinite set models this, but also in this language we have that any two infinite sets are elementarily equivalent. For example,

LLLLP().

Question: How do we prove a theory is complete?

Theorem 1.8 (Los-Vaught test). Assuming that:

  • T is an L-theory

  • T has no finite models

  • There exists some K|L|+0 such that any two models of T of cardinality κ are elementarily equivalent

Then T is complete.

Proof. Assume T is not complete, i.e. there is some L-sentence σ such that T{σ} and T{¬σ} are both satisfiable.

So we have MT{σ}, NT{¬σ}.

From (a) we know M,N are infinite. By Lowenheim-Skölem, we know we have MT{σ} and NT{¬σ} with |M|=|N|=κ, contradicting (b).

Reminder: By combining Lowenheim-Skölem up and down, we get the following statement:

If an L-theory T has an infinite model, then it has a model of size κ for every κ|L|+0.