Reflexive games and non-Archimedean probabilities

Research Articles

DOI: 10.1134/S2070046614010051

Cite this article as:
Schumann, A. P-Adic Num Ultrametr Anal Appl (2014) 6: 66. doi:10.1134/S2070046614010051


In reflexive games we deal with an unlimited hierarchy of cognitive pictures. Aumann’s understanding of common knowledge satisfies the classical intuition that we can appeal only to inductive sets in our reasoning about these cognitive pictures involved in reflexive games. In this paper I propose to deny this intuition and appeal to non-Archimedean probabilities in defining cognitive pictures of our reflexion. This allows us to define reflexive games of finite or infinite levels.

Key words

AumannTs agreement theorem reflexion disagreement theorem knowledge operators non-Archimedean probabilities p-adic probabilities 

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.University of Information Technology and ManagementRzeszowPoland

Personalised recommendations