首页 | 本学科首页   官方微博 | 高级检索  
     


The Incompleteness of Theories of Games
Authors:Tsuji  Marcelo  da Costa  Newton C. A.  Doria  Francisco A.
Affiliation:(1) Reseach Group on Logic and Foundations, Institute for Advanced Studies, University of São Paulo, 05655-010 São Paulo SP, Brazil (E-mail: Email;(2) Department of Physics, Institute for the Exact Sciences (ICE), Federal University at Juiz de Fora, Brazil (E-mail: Email
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:Chaitin  incompleteness  noncooperative games  Richardson's functor  undecidability
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号