The logical representation of extensive games (Q687063): Difference between revisions

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)\).