Probabilities on streams and reflexive games

Probability measures on streams (e.g. on hypernumbers and p-adic numbers) have been defined. It was shown that these probabilities can be used for simulations of reflexive games. In particular, it can be proved that Aumann’s agreement theorem does not hold for these probabilities. Instead of this theorem, there is a statement that is called the reflexion disagreement theorem. Based on this theorem, probabilistic and knowledge conditions can be defined for reflexive games at various reflexion levels up to the infinite level.