The incompleteness of theories of games
First, a few previously obtained results are stated dealing with general undecidability and incompleteness in axiomatized theories that range from the theory of finite sets to classical elementary analysis. Out of these results, several incompleteness theorems are proved for the theory of noncooperative games; in particular, it is shown tha there exist finite games whose Nash equilibria cannot be proven to be computable.
scientific article; zbMATH DE number 1248201