The logical representation of extensive games
Given is an extensive form \(G\) in which every choice is associated an atomic sentence and with every information set a set of well-formed formulas (wffs) of propositional calculus. The set of such wffs is denoted by \(\Gamma(G)\). Using the so-called topological semantics for propositional calculus (which differs from the standard one based on truth tables), it is shown that the extensive form yields a topological model of \(\Gamma(G)\), that is, every wff in \(\Gamma(G)\) is ``true in \(G\). It is also shown that within the standard truth-table semantics for propositional calculus, there is a one-to-one and onto correspondence between the set of plays of \(G\) and the set of valuations that satisfy all the wffs in \(\Gamma(G)\).
- Extensive forms and set-theoretic forms
- Final decisions, the Nash equilibrium and solvability in games with common knowledge of logical abilities
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3198011 (Why is no real title available?)
- Mathematical logic. An introduction to model theory. Edited by H. B. Enderton
- Rationality, Computability, and Nash Equilibrium
- Some notes on Church's thesis and the theory of games
This page was built for publication: The logical representation of extensive games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687063)