6
Games for MSO
•
Theorem
The duplicator has a winning
strategy for k moves if
A
and
B
are
indistinguishable in MSO[k]
•
•
[ What is MSO[k] ? ]
•
•
Both statement and proof are almost identical
to the first order case.