Tarski's fixpoint lemma and combinatorial games

DOI10.1007/BF00383202zbMath0733.90091OpenAlexW2077065689WikidataQ124807784 ScholiaQ124807784MaRDI QIDQ810391

Bernhard Banaschewski, Ales Pultr

Publication date: 1991

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00383202

zbMATH Keywords

complete latticeexistence of winning strategiesgames on latticesgames on superalgebraic latticesgames with a topological tolerancepersistent strategies for combinatorial gamesTarski's fixpoint lemma for order preserving maps

Mathematics Subject Classification ID

2-person games (91A05) Ordered sets (06A99) Combinatorial games (91A46) Lattices (06B99)

Related Items

Cop-win graphs with maximum capture-time

Cites Work

• Remarks on strategies in combinatorial games
• The fundamental duality of partially ordered sets
• Sur une théorie ensembliste des jeux alternatifs
• Graphs and composite games