Skip to main content
Log in

The Incompleteness of Theories of Games

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Bacharach, M. and Mongin, P. (eds), Theory and Decision, special issue 37(1994).

  2. Casti, J. L. and Traub, J. F., ‘On limits’, Santa Fe Institute Publications 94–10-056(1994).

  3. Casti, J. L. and Karlqvist, A. (eds), Boundaries and Barriers, Addison-Wesley (1996).

  4. da Costa, N. C. A. and Chuaqui, R., ‘On Suppes' Set-Theoretical Predicates’, Erkenntnis 29 (1988), 95–112.

    Google Scholar 

  5. da Costa, N. C. A. and Doria, F. A., ‘Undecidability and Incompleteness inClassical Mechanics’, International Journal of Theoretical Physics 30 (1991), 1041–1073.

    Google Scholar 

  6. daCosta, N. C. A. and Doria, F. A., ‘Classical Physics and Penrose's Thesis’, Foundations of Physics Letters 4 (1991), 363–373.

    Google Scholar 

  7. da Costa, N. C. A. and Doria, F. A., ‘Suppes Predicates and theConstruction of Unsolvable Problems in the Axiomatized Sciences’, in P. Hunmpreys (ed.), Patrick Suppes, Scientific Philosopher, Vol. II, Kluwer (1994), 151–191.

  8. da Costa, N. C. A. and Doria, F. A.,‘Gödel Incompleteness, Explicit Expressions for Complete Degrees and Applications’, Complexity 1 (1995), 40–55.

    Google Scholar 

  9. da Costa, N. C. A. and Doria, F. A., ‘Independence of WPH for the SatisfiabilityProblem from the Axioms of Set Theory,’ 11th Brazilian Symposium on Artificial Intelligence, Curitiba (PR, Brazil, 1996).

  10. da Costa, N. C. A., Doria, F. A. and Furtado do Amaral, A. F., ‘A Dynamical Systemwhere proving Chaos is equivalent to proving Fermat's Conjecture,’ International Journal of Theoretical Physics 32 (1993), 2187–2206.

    Google Scholar 

  11. da Costa, N. C. A., Doria, F. A. and Tsuji, M., ‘The Undecidabilityof Formal Definitions in the Theory of Finite Groups,’ Bulletin of the Section of Logic 24 (1995), 56–63.

    Google Scholar 

  12. Davis, M., ‘Hilbert's Tenth Problem is Unsolvable,’ in Computability and Unsolvability, 2nd.edition, Dover (1982).

  13. Doria, F. A., ‘Some new incompleteness theorems and their import to thefoundations of mathematics,’ Preprint Griffo (1997).

  14. Jones, J. P., ‘Universal Diophantineequations,’ Journal of Symbolic Logic 47 (1982), 549–571.

    Google Scholar 

  15. Harrop, R., Zeitschrift fürMathematische Logik und Grundlagen der Mathematik 7 (1961), 136–140.

    Google Scholar 

  16. Lewis, A. A., ‘OnTuring Degrees of Walrasian Models and a General Impossibility Result in the Theory of Decision Making,’ Preprint, Univ. of California at Irvine, School of Social Sciences (1991).

  17. Lewis, A. A. and Inagaki, Y., ‘On theEffective Content of Theories,’ Preprint, Univ. of California at Irvine, School of Social Sciences (1991).

  18. Prasad, K., ‘Computability and Randomness of Nash Equilibrium in Infinite Games’, Journal ofMathematical Economics 20 (1991), 429–442.

    Google Scholar 

  19. Seligman, B. B., Main Currents in ModernEconomics, I–III, Quadrangle Books, Chicago (1971).

    Google Scholar 

  20. Stewart, I., ‘Deciding theUndecidable’, Nature 352 (1991), 664–665.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tsuji, M., da Costa, N.C.A. & Doria, F.A. The Incompleteness of Theories of Games. Journal of Philosophical Logic 27, 553–568 (1998). https://doi.org/10.1023/A:1004220919753

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1004220919753

Navigation