The incompleteness of theories of games
Journal of Philosophical Logic 27 (6):553-568 (1998)
| Abstract | We first state a few previously obtained results that lead to general undecidability and incompleteness theorems in axiomatized theories that range from the theory of finite sets to classical elementary analysis. Out of those results we prove several incompleteness theorems for axiomatic versions of the theory of noncooperative games with Nash equilibria; in particular, we show the existence of finite games whose equilibria cannot be proven to be computable. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesWalter Elberfeld (2000). An Analysis of Stability Sets in Pure Coordination Games. Theory and Decision 49 (3):235-248.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Newton C. A. da Costa & Francisco A. Doria (1995). Undecidability, Incompleteness and Arnol'D Problems. Studia Logica 55 (1):23 - 32.
Giovanni Facchini, Freek van Megen, Peter Borm & Stef Tijs (1997). Congestion Models and Weighted Bayesian Potential Games. Theory and Decision 42 (2):193-206.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads28 ( #44,065 of 549,065 )Recent downloads (6 months)1 ( #63,185 of 549,065 )How can I increase my downloads? |
My notes
Discussion
