Trace semantics has proven an adequate semantics to non-deterministic and probabilistic systems seen as coalgebras in the Kleisli-category. States with the same trace semantics are called trace equivalent. In the talk I will present our first approach to a logic which characterises states of non-deterministic coalgebras up to trace equivalence and show where it generalises to probabilism.