EF logic

I will talk about a simple temporal logic EF over finite words, infinite words and finite trees. I will show that a language is definable by an EF formula if and only if its syntactic algebra satisfies certain equations. Eventually I will present some examples which exhibit the difficulty of EF over infinite trees.