A logic for finite games /
A formalism and calculus is presented for the treatment of a normal modal logic with two principal operators: 'necessarily next' and 'necessarily prior'. The formalism is proposed as an efficient means of representing classes of game configurations for a broad range of finite gam...
Main Author: | Mackling, Thomas. |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
1991
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61217 |
Similar Items
-
Embedding theorems and finiteness properties for residuated structures and substructural logics
by: Hsieh, Ai-Ni.
Published: (2010) -
on the Minimax Theorem and the Solution of Finite Games.
by: Cavadias, George S.
Published: (1959) -
Logic and the Foundations of Game and Decision Theory (LOFT 7)
Published: (2008) -
Symmetric dialogue games in the proof theory of linear logic
by: Delande, Olivier
Published: (2009) -
Finite rationality and repeated game.
Published: (1998)