  In this short note, we are concerned with the fairness condition "A and B
hold almost equally often", which is important for specifying and verifying the
correctness of non-terminating processes and protocols. We introduce the logic
of temporal domination, in which the above condition can be expressed. We
present syntax and semantics of our logic and show that it is a proper
extension of linear time temporal logic. In order to obtain this result, we
rely on the corresponding result for k-counting automata.
