Our paper studies Chance Discovery (CD) in terms of temporal multi-agent logic. Prime question is how to express most essential properties of CD in terms of temporal branching time multi-agents’ logic; how to define CD by formulas in this logical language.We, as an example, introduce several formulas in the language of temporal multi-agent logic which may express essential properties of CD. In the second part of this paper we study computational questions concerning suggested logic. Using some light modification of the standard filtration technique we show that the logic has the finite-model property with effectively computable upper bound. This proves that the logic is decidable and provides a decision algorithm. Thus, we may identify equivalence of statements about CD (in terms of suggested logic) and recognize satisfiable and contradictory statements.