Prisoner's dilema game can be represented as a game tree, which could be infinite game with corresponding infinite game (binary) tree in common case.
There is well-known tit for tat strategy, which can be optimal strategy for this game.
The question is: can this strategy be defined in monadic second-order logic for such infinite game tree? What will be the MSO-formula in such case?