The logical representation of extensive games (Q687063)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 429109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The logical representation of extensive games |
scientific article; zbMATH DE number 429109 |
Statements
The logical representation of extensive games (English)
0 references
4 January 1994
0 references
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)\).
0 references
extensive form
0 references
well-formed formulas
0 references
propositional calculus
0 references
topological semantics
0 references
0 references
0.7897945642471313
0 references
0.7697793245315552
0 references
0.7682265043258667
0 references
0.7550080418586731
0 references
0.7503765821456909
0 references
