 Rabin’s theorem has any number of useful consequences. For example Dov Gabbay used it to prove the decidability of some modal logics. But Rabin’s proof, using automata, was notoriously difficult to follow. Yuri Gurevich and Leo Harrington, and independently Andrei Muchnik, found much simpler proofs in which the automaton is a player in a game.