On lattices from combinatorial game theory modularity and a representation theorem: finite case (Q2437772): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3433876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices of games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the number of games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective geometries as cover-preserving sublattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The representation of posets and lattices by sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536659 / rank
 
Normal rank

Latest revision as of 10:50, 7 July 2024

scientific article
Language Label Description Also known as
English
On lattices from combinatorial game theory modularity and a representation theorem: finite case
scientific article

    Statements

    On lattices from combinatorial game theory modularity and a representation theorem: finite case (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 March 2014
    0 references
    combinatorial game theory
    0 references
    lattices
    0 references
    modularity
    0 references
    representation theorems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers