Skip to main content
SpringerLink
Log in

Games as formal tools versus games as explanations in logic and science

  • Published:
Foundations of Science Aims and scope Submit manuscript

Abstract

This paper addresses the theoretical notion of a game as it arisesacross scientific inquiries, exploring its uses as a technical andformal asset in logic and science versus an explanatory mechanism. Whilegames comprise a widely used method in a broad intellectual realm(including, but not limited to, philosophy, logic, mathematics,cognitive science, artificial intelligence, computation, linguistics,physics, economics), each discipline advocates its own methodology and aunified understanding is lacking. In the first part of this paper, anumber of game theories in formal studies are critically surveyed. Inthe second part, the doctrine of games as explanations for logic isassessed, and the relevance of a conceptual analysis of games tocognition discussed. It is suggested that the notion of evolution playsa part in the game-theoretic concept of meaning.

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

Access this article

Log in via an institution

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

  • Abramsky, S. and R. Jagadeesan: 1994, Games and Full Completeness for Multiplicative Linear Logic. Journal of Symbolic Logic 59: 543–574.

    Google Scholar 

  • Abramsky, S., S.J. Gay and R. Nagarajan: 1996, Interaction Categories and the Foundations of Typed Concurrent Programming. In M. Broy (ed.), Proceedings of the 1994Marktoberdorf Summer School on Deductive Program Design. New York: Springer, 35–113.

    Google Scholar 

  • Abramsky, S. and P.-A. Melliès: 1999, Concurrent Games and Full Completeness. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 431–442.

  • Ashworth, E.J.: 1976, Agostino Nifo's Reinterpretation of Medieval Logic. Rivista Critica di Storia Della Filosofia 31: 354–374.

    Google Scholar 

  • Bacharach, M.O.L., L.-A. Gèrard-Varet, P. Mongin and H.S. Shin (eds.): 1997, Epistemic Logic and the Theory of Games and Decisions. Dordrecht: Kluwer.

    Google Scholar 

  • Barwise, J. and S. Feferman (eds.): 1985, Model Theoretic Logics. Berlin: Springer.

    Google Scholar 

  • van Benthem, J.: 1988, Games in Logic. In J.Ph. Hoepelman (ed.), Representation and Reasoning, Proceedings of the Stuttgart Conference Workshop on Discourse Representation, Dialogue Tableaux and Logic Programming. Tübingen: Niemeyer Verlag, 3–15.

    Google Scholar 

  • van Benthem, J.: 1993, Modeling the Kinematics of Meaning. Proceedings of the Aristotelian Society 93: 105–122.

    Google Scholar 

  • van Benthem, J.: 1999, Wider and Still Wider: Resetting the Bounds of Logic. In A. Varzi (ed.), The European Review of Philosophy, vol. 4. Stanford: CSLI Publications, 21–44.

    Google Scholar 

  • Binmore, K.: 1996, A Note on Imperfect Recall. In W. Guth et al. (eds.), Understanding Strategic Interaction: Essays in Honor of Reinhard Selten. New York: Springer, 51–62.

    Google Scholar 

  • Blass, A.: 1992, A Game Semantics for Linear Logic. Annals of Pure and Applied Logic 56: 183–220.

    Google Scholar 

  • Blass, A.: 1994, Is Game Semantics Necessary? In E. Börger, Y. Gurevich and K. Meinke (eds.), Computer Science Logic, Lecture Notes in Computer Science, vol. 832. Springer, 66–77.

  • Borel, E.: 1921, La théorie du jeu et les equations intégrales à noyau symétrique. Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences 173: 1304–1308. (Translation, 1953: The Theory of Play and Integral Equations with Skew Symmetric Kernels. Econometrica 21: 97–100.)

    Google Scholar 

  • Carse, J.P.: 1986, Finite and Infinite Games: A Vision of Life as Play and Possibility. New York: Ballantine Books.

    Google Scholar 

  • De Vos, M. and D. Vermeir: 1999, Choice Logic Programs and Nash Equilibria in Strategic Games. In J. Flum and M. Rodriguez-Artalejo (eds.), Computer Science Logic, Lecture Notes in Computer Science, vol. 1683, Springer, 266–276.

  • Felscher, W.: 2002, Dialogues as a Foundation for Intuitionistic Logic. In D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, vol. 5, 2nd edn. Dordrecht: Kluwer, 115–146.

    Google Scholar 

  • Frieden. R.: 1998, Physics From Fisher Information. Cambridge, MA: Cambridge University Press.

    Google Scholar 

  • Gale, D. and F.M. Stewart: 1953, Infinite Games with Perfect Information. In H.W. Kuhn and A.W. Tucker (eds.), Contributions to the Theory of Games, vol. II. Princeton: Princeton University Press, 245–266.

    Google Scholar 

  • Girard, J-Y.: 1998, On the Meaning of Logical Rules I: Syntax vs. Semantics, ms. Available electronically at http://iml.univ-mrs.fr/pub/girard/meaning1.ps.gz.

  • Henkin, L.: 1961, Some Remarks on Infinitely Long Formulas. InfinisticMethods. Proceedings of the Symposium on Foundations of Mathematics, Warsaw, Panstwowe (l2–9 September 1959). New York: Wydawnictwo, Naukowe and Pergamon Press, 167–183.

    Google Scholar 

  • Hilpinen, R.: 1982, On C.S. Peirce's Theory of the Proposition: Peirce as a Precursor of Game-Theoretical Semantics. The Monist 62: 182–189.

    Google Scholar 

  • Hintikka,: 1973. Logic, Language-Games and Information. Oxford: Clarendon.

    Google Scholar 

  • Hintikka, J.: 1995, The Games of Logic and the Games of Inquiry. Dialectica 49: 229–249.

    Google Scholar 

  • Hintikka, J.: 1996, The Principles of Mathematics Revisited. New York: Cambridge University Press.

    Google Scholar 

  • Hintikka, J.: 1999, Inquiry as Inquiry: A Logic of Scientific Discovery. Dordrecht: Kluwer.

    Google Scholar 

  • Hintikka, J. and J. Kulas: 1983, The Game of Language: Studies in Game-Theoretical Semantics and its Applications. Dordrecht: Reidel.

    Google Scholar 

  • Hintikka, J. and J. Kulas: 1985, Anaphora and Definite Descriptions. Dordrecht: Reidel.

    Google Scholar 

  • Hintikka, J. and V. Rantala: 1976, A New Approach to Infinitary Languages. Annals of Mathematical Logic 10: 95–115.

    Google Scholar 

  • Hintikka, J. and G. Sandu: 1995, What is the Logic of Parallel Processing? International Journal of Foundations of Computer Science 6: 27–49.

    Google Scholar 

  • Hintikka, J. and G. Sandu: 1997, Game-Theoretical Semantics. In J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language. Amsterdam: Elsevier, 361–410.

    Google Scholar 

  • Hodges, W.: 1997, Games in Logic. In P. Dekker et al. (eds.), Proceedings of the Eleventh Amsterdam Colloquium 1997. Amsterdam: University of Amsterdam, 13–18.

    Google Scholar 

  • Hyland, J.M.E. and C.-H.L. Ong: 2000, On Full Abstraction for PCF. I. Models, Observables and the Full Abstraction Problem, II. Dialogue Games and Innocent Strategies, III. A Fully Abstract and Universal Game Model. Information and Computation 163: 285–408.

    Google Scholar 

  • Jackson, P.: 1987, A Representation Language Based on a Game-Theoretic Interpretation of Logic. Dissertation, University of Leeds.

  • Janasik, T., A. Pietarinen and G. Sandu: in press, Anaphora and Extensive Games. In Proceedings of the 38th Chicago Linguistic Society.

  • Kalmàr, L.: 1928–1929, Zur Theorie der abstrakten Spiele. Acta Scientiarum Mathematicarum (Szeged) 4: 65–85. (Translation, 1997: On the Theory of Abstract Games. In M.A. Dimand and R.W. Dimand (eds.), The Foundations of Game Theory, vol. 1. Cheltenham: Edward Elgar, 247–262.)

    Google Scholar 

  • Kiikeri, M.: 1997, On the Logical Structure of Learning Models. In M. Sintonen (ed.), Knowledge and Inquiry: Essays on Jaakko Hintikka's Epistemology and Philosophy of Science. Amsterdam: Rodopi, 287–308.

    Google Scholar 

  • Kirby, S.: 2000, Syntax Without Natural Selection: How Compositionality Emerges from Vocabulary in a Population of Learners. In C. Knight, J. Hurford and M. Studdert-Kennedy (eds.), The Evolutionary Emergence of Language: Social Function and the Origins of Linguistic Form. New York: Cambridge University Press, 303–323.

    Google Scholar 

  • Klir, G.J.: 2001, Facets of System Science, 2nd edn. Dordrecht: Kluwer.

    Google Scholar 

  • König, D.: 1927, Über eine Schlußweise aus dem Endlichen ins Unendliche (On a Consequence of Passing from the Finite to the Infinite). Acta Scientiarum Mathematicarum (Szeged) 3: 121–130.

    Google Scholar 

  • Koller, D.: 1995, A Game-Theoretic Classification of Interactive Complexity Classes. Proceedings of the 10th Annual IEEE Conference on Structure in Complexity Theory, 227–237.

  • Kretzmann, N. and E. Stump: 1988, The Cambridge Translations of Medieval Philosophical Texts, vol. 1. Melbourne: Cambridge University Press.

    Google Scholar 

  • Krynicki, M. and M. Mostowski: 1995, Henkin Quantifiers. In M. Krynicki, M. Mostowski and L.W. Szczerba (eds.), Quantifiers: Logics, Models and Computation, vol. 1. Dordrecht: Kluwer, 193–262.

    Google Scholar 

  • Leibniz, G.W.: 1981, New Essays on Human Understanding, P. Remnant and J. Bennett (trans. and ed.). Cambridge: Cambridge University Press.

    Google Scholar 

  • Lorenz, K.: 1961, Arithmetic und Logic als Spiele. Dissertation, Universität Kiel. (Partially reprinted in Lorenzen and Lorenz, 1978.)

  • Lorenz, K.: 2001, Basic Objectives of Dialogue Logic in Historical Perspective. Synthese 127: 255–263.

    Google Scholar 

  • Lorenzen, P.: 1955, Einführung in die operative Logik und Mathematik. Die Grundlehren der mathematischen wissenschaften, vol. 78. Berlin: Springer.

    Google Scholar 

  • Lorenzen, P. and K. Lorenz: 1978, Dialogische Logic. Darmstadt: Wissenschaftliche Buchgesellschaft.

    Google Scholar 

  • Mann, W.C.: 1988, Dialogue Games: Conventions of Human Interaction. Argumentation 2: 511–532.

    Google Scholar 

  • Maynard Smith, J.: 1979, Hypercycles and the Origin of Life. Nature 280: 445–446.

    Google Scholar 

  • Maynard Smith, J.: 1982, Evolution and the Theory of Games. Cambridge: Cambridge University Press.

    Google Scholar 

  • Mittelstaedt, P.: 1978, Quantum Logic. Dordrecht: Reidel.

    Google Scholar 

  • Muggleton S.: 1993, Inductive Logic Programming. San Diego: Academic Press.

    Google Scholar 

  • von Neumann, J.: 1928, Zur Theorie der Gesellschaftsspiele. Mathematische Annalen 100: 295–320. (Translation, 1959: On the Theory of Games of Strategy. In A.W. Tucker and R.D. Luce (eds.), Contributions to the Theory of Games, vol. IV. Princeton: Princeton University Press, 13–42.)

    Google Scholar 

  • von Neumann, J. and O. Morgenstern: 1944, The Theory of Games and Economic Behavior. New York: John Wiley.

    Google Scholar 

  • de Nivelle, H.: 1995, Resolution Games and Non-Liftable Resolution Orderings. In L. Pacholski and J. Tiuryn (eds.), Computer Science Logic, Lecture Notes in Computer Science, vol. 933. Springer, 279–293.

  • Nowak, A., J.B. Plotkin and D.C. Krakauer: 1999, The Evolutionary Language Game. Journal of Theoretical Biology 200: 147–162.

    Google Scholar 

  • Oliphant, M. and J. Batali: 1996, Learning and the Emergence of Coordinated Communication. Center for Research on Language Newsletter 11.

  • Pauly, M.: 2001, Logic for Social Software. Dissertation, University of Amsterdam.

  • Peirce, C.S.: 1931–1966. Collected Papers of Charles Sanders Peirce, 8 vols., C. Hartshorne, P. Weiss and A.W. Burks (eds.). Cambridge: Harvard University Press.

    Google Scholar 

  • Peirce, C.S.: 1967, Manuscripts in the Houghton Library of Harvard University, as identified by Richard Robin, Annotated Catalogue of the Papers of Charles S. Peirce. Amherst: University of Massachusettes Press and in (1971), The Peirce Papers: A Supplementary Catalogue. Transactions of the C.S. Peirce Society 7: 37–57.

    Google Scholar 

  • Pietarinen, A.: 2001a, Most Even Budged Yet: Some Cases for Game-Theoretic Semantics in Natural Language. Theoretical Linguistics 27: 20–54.

    Google Scholar 

  • Pietarinen, A.: 2001b, Varieties of IFing. In G. Sandu and M. Pauly (eds.), Proceedings of the ESSLLI 2001 Workshop on Logic and Games. University of Helsinki.

  • Pietarinen, A.: 2001c, Intentional Identity Revisited. Nordic Journal of Philosophical Logic 6: 144–188.

    Google Scholar 

  • Pietarinen, A.: 2002a, Quantum Theory and Quantum Logic in a Game-Theoretic Perspective. Open Systems and Information Dynamics 9: 273–290.

    Google Scholar 

  • Pietarinen, A.: 2002b, Some Useful Social Metaphors in Logic. Proceedings of the Second International Workshop on Computational Models of Scientific Reasoning and Applications. CSREA Press.

  • Pietarinen, A.: 2002c, Negotiation Games and Conflict Resolution in Logical Semantics. In P. Boquet (ed.), Meaning Negotiation: Papers from the AAAI Workshop MeaN-02. AAAI Press, 25–31.

  • Pietarinen, A.: 2003a, Peirce's Game-Theoretic Ideas in Logic. Semiotica 144: 33–47.

    Google Scholar 

  • Pietarinen, A.: 2003b, Logic and Coherence in the Light of Competitive Games. Logique et Analyse 43: 371–391.

    Google Scholar 

  • Pietarinen, A.: 2003c, Semantic Games in Logic and Epistemology. In D. Gabbay, S. Rahman, J. Symons and J.-P. Van Bendegem (eds.), Logic, Epistemology and the Unity of Science. Kluwer Academics.

  • Pietarinen, A.: 2003d, What Do Epistemic Logic and Cognitive Science Have to Do With Each Other? Cognitive Systems Research 4: 169–190.

    Google Scholar 

  • Pietarinen, A. and G. Sandu: 1999, Games in Philosophical Logic. Nordic Journal of Philosophical Logic 4, 143–173.

    Google Scholar 

  • Rabin, M.: 1957, Effective Computability of Winning Strategies. In M. Dresher, A.W. Tucker and P. Wolfe (eds.), Contributions to the Theory of Games, vol. III. Princeton: Princeton University Press, 147–157.

    Google Scholar 

  • Rahman, S. and H. Rückert: 2001, Dialogical Connexive Logic. Synthese 127: 105–139.

    Google Scholar 

  • Sandu, G.: 1997, On the Theory of Anaphora: Dynamic Predicate Logic vs. Game-Theoretical Semantics. Linguistics and Philosophy 20, 147–174.

    Google Scholar 

  • Sandu, G. and A. Pietarinen: 2001, Partiality and Games: Propositional Logic. Logic Journal of the IGPL 9, 107–127.

    Google Scholar 

  • Sandu, G. and A. Pietarinen: in press, Informationally Independent Connectives. To appear in I. van Loon, G. Mints and R.Muskens (eds.), Logic, Language and Computation, vol. 9. Stanford: CSLI Publications.

  • Schwalbe, U. and P. Walker: 2001, Zermelo and the Early History of Game Theory. Games and Economic Behaviour 34: 123–137.

    Google Scholar 

  • Scott, D.: 1993, A Game-Theoretical Interpretation of Logical Formulae (Original manuscript 1968). Jahrbuch 1991 der Kurt-Goedel-Gesellschaft. Wien: Kurt-Goedel-Gesellschaft, 47–48.

    Google Scholar 

  • Skolem, T.: 1920, Logico-Combinatorial Investigations in the Satisfiability or Provability of Mathematical Propositions: A Simplified Proof of a Theorem by L. Löwenheim and Generalizations of the Theorem. In J. van Heijenoort (ed.) (1967), From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931. Cambridge: Harvard University Press, 254–263. (Original: Logischkombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischen Sätze nebst einem Theoreme über dichteMengen. Skrifter utgit av Videnskabsselskapet i Kristiania, Vol. 1, Matematisk-naturvidenskabelig klasse 4, 1–36. Reprinted in Skolem, T.: 1970, Selected Works in Logic, J.E. Fenstad (ed.). Oslo: Universitetsforlaget, 103–136.)

    Google Scholar 

  • Stalnaker, R.: 1999, Extensive and Strategic Forms: Games and Models for Games. Research in Economics 53: 293–319.

    Google Scholar 

  • Steinhaus, H.: 1960, Definition for a Theory of Games and Pursuit. Naval Research Logistic Quarterly 7: 105–108. (Originally published in 1925 in Mysl Akademicka 1, 13–14 (University of Lvov).)

    Google Scholar 

  • Ulam, S.M.: 1960, A Collection of Mathematical Problems. Groningen: Interscience Publishers.

    Google Scholar 

  • Valiant, L.G.: 1984, A Theory of the Learnable. Communications of the ACM 27: 1134–1142.

    Google Scholar 

  • Weibull. J.W.: 1995, Evolutionary Game Theory. Cambridge: MIT Press.

    Google Scholar 

  • Wittgenstein, L.: 1978, Philosophical Grammar. Columbia: University of California Press.

    Google Scholar 

  • Wittgenstein, L.: 1953, Philosophical Investigations. Oxford: Blackwell.

    Google Scholar 

  • Wittgenstein, L.: 2000, Wittgenstein's Nachlass, The Bergen Electronic Edition. The Wittgenstein Trustees, The University of Bergen, Oxford University Press. (The transcription used is the diplomatic transcription.)

  • Yates: C.E.M.: 1976, Banach-Mazur Games, Comeager Sets, and Degrees of Unsolvability. Mathematical Proceedings of Cambridge Philosophical Society 79: 195–220.

    Google Scholar 

  • Yrjönsuuri, M. (ed.): 2001, Medieval Formal Logic: Obligations, Insolubles and Consequences. Dordrecht: Kluwer.

    Google Scholar 

  • Zermelo, E.: 1913, Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In E.W. Hobson and A.E.H. Love (eds.), Proceedings of the Fifth International Congress of Mathematicians, vol. II. Cambridge: Cambridge University Press, 501–504. (Translation: On an application of set theory to the theory of the game of chess, in Appendix to Schwalbe andWalker, 2001.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, University of Helsinki, P.O. Box 9, FIN-00014, Finland

    Ahti-Veikko Pietarinen

Authors
  1. Ahti-Veikko Pietarinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pietarinen, AV. Games as formal tools versus games as explanations in logic and science. Foundations of Science 8, 317–364 (2003). https://doi.org/10.1023/A:1026319711838

Download citation

  • Issue Date:

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

Search

Navigation