•For each rank-k m-type t there exists a
unique
rank-k formula f s.t. A
² f(a) iff tpk(A,a) = t
•
•In other words, if M = {f1, …, fn} are all formulas in
FO[k] with n free variables, then for every subset M0 µ M there exists a f 2 M s.t. f = (Æy 2 M0) y Æ (Æy Ï M0 : y)