12
Computing Types
•
Slightly harder question:
•
Given (A,
a
), derive a formula
f
(
x
) s.t.
forall (B,
b
):
B
²
f
(
b
)
iff tp
FO
k
(B,
b
) = tp
FO
k
(A,
a
)
•
•
Theorem
f
can be expressed in FO
k
•
Proof
in the book