2
As mentioned above: question answered by reference to FO(TC) games presented in Finite Model Theory by Ebbinghaus and Flum.
Only top voted, non community-wiki answers of a minimum length are eligible
Related Tags
finite-model-theory × 35lo.logic × 20
descriptive-complexity × 16
cc.complexity-theory × 10
reference-request × 7
regular-language × 4
db.databases × 4
graph-theory × 3
graph-algorithms × 3
automata-theory × 3
complexity-classes × 2
fl.formal-languages × 2
computability × 2
terminology × 2
dfa × 2
model-checking × 2
model-theory × 2
ds.algorithms × 1
circuit-complexity × 1
pl.programming-languages × 1
turing-machines × 1
graph-isomorphism × 1
np-complete × 1
parameterized-complexity × 1
semantics × 1