11
More EF Games (informally)
•
Prove, informally, the following:
. . .
(N,S)
º
(N,S)
[
(Z,S)
º
k
. . .
. . .
. . .
º
(Perfectly balanced binary trees are not expressible in FO)
