23
A Taste of FMT
•
Example 1
•
Let
s
= {R}; a
s
-structure A is a graph
•
CONN is the property that the graph is
connected
•
•
Theorem
CONN is not expressible in FO