The Logical Representation of Extensive Games
AbstractGiven an extensive form "G", we associate with every choice 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), we show that the extensive form yields a topological model of [Gamma](G), that is, every wff in [Gamma](G), is "true in G". We also show 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).
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoArticle provided by Springer in its journal International Journal of Game Theory.
Volume (Year): 22 (1993)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.