Tarski's Fixpoint Lemma and combinatorial games |
| |
Authors: | B Banaschewski A Pultr |
| |
Institution: | (1) Department of Mathematics and Statistics, McMaster University, 1280 Main Street West, L8S 4K1 Hamilton, Ontario, Canada;(2) Department of Applied Mathematics, Charles University, Malostranské nám. 25, 11800 Praha 1, Czechoslovakia |
| |
Abstract: | Using Tarski's Fixpoint Lemma for order preserving maps of a complete lattice into itself, a new, lattice theoretic proof is given for the existence of persistent strategies for combinatorial games as well as for games with a topological tolerance and games on lattices. Further, the existence of winning strategies is obtained for games on superalgebraic lattices, which includes the case of ordinary combinatorial games. Finally, a basic representation theorem is presented for those lattices. |
| |
Keywords: | 90D05 90D42 06A99 |
本文献已被 SpringerLink 等数据库收录! |
|