Similarly, counting the number of solutions of a quantifier-free query over
structures of bounded expansion reduces to counting the number of solutions of
a MSO query over structures of bounded treewidth. This latter problem is known to be in
FPL [1]}. We give here a direct and simple proof of this fact for FO queries over structures of bounded expansion.
