The incompleteness of theories of games
type: Item
instance of: scholarly article
title: The incompleteness of theories of games
zbMATH Open document ID: 0919.03037
DOI: 10.1023/A:1004220919753
author: Marcelo Tsuji
author: N. C. A. da Costa
author: Francisco Antonio Doria
published in: Journal of Philosophical Logic
publication date: 1999-04-22T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 03A05
zbMATH DE Number: 1248201
zbMATH Keywords: undecidability
zbMATH Keywords: incompleteness
zbMATH Keywords: axiomatized theories
zbMATH Keywords: noncooperative games
zbMATH Keywords: finite games
zbMATH Keywords: Nash equilibria
reviewed by: Giacomo Bonanno
MaRDI profile type: Publication
cites work: Undecidability and incompleteness in classical mechanics
cites work: Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications
cites work: Dynamical system where proving chaos is equivalent to proving Fermat's conjecture
cites work: Q4851407
cites work: Hilbert's Tenth Problem is Unsolvable
cites work: Universal diophantine equation
cites work: On the Recursivity of Finite Sets
cites work: Computability and randomness of Nash equilibrium in infinite games
description: scientific article; zbMATH DE number 1248201