On lattices from combinatorial game theory: infinite case
From MaRDI portal
Publication:2230543
DOI10.1007/S00182-020-00715-3OpenAlexW3012333240MaRDI QIDQ2230543FDOQ2230543
Authors: Alda Carvalho, Carlos Santos, Cátia Dias, Francisco Coelho, R. J. Nowakowski, Sandra Vinagre, João Pedro Neto 
Publication date: 24 September 2021
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-020-00715-3
Recommendations
Cites Work
- Combinatorial game theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set Theory
- Misère-play Hackenbush sprigs
- Dead ends in misère play: the misère monoid of canonical numbers
- The lattice structure of \(n\)-player games
- Title not available (Why is that?)
- Lattices of games
- Counting the number of games
- Title not available (Why is that?)
- On lattices from combinatorial game theory modularity and a representation theorem: finite case
- Invertibility modulo dead-ending no-\(\mathcal{P}\)-universes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Lattices of games
- The lattice structure of \(n\)-player games
- A lattice-theoretic approach to a class of dynamic games
- On lattices from combinatorial game theory modularity and a representation theorem: finite case
- Title not available (Why is that?)
- The structure of the distributive lattice of games born by day \(n\)
- Lattice point methods for combinatorial games
This page was built for publication: On lattices from combinatorial game theory: infinite case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230543)
