12
Examples
•
Let
s
= {R}, i.e. a single binary relation.
Finite models are graphs.
•
•
Express the following in SO
–
The graph is connected
[what 2
nd
order quantifiers did we need ?]
–
The graph is 3-colorable
–
The graph has a Hamiltonean path