Publication
On lattices from combinatorial game theory modularity and a representation theorem: finite case
dc.contributor.author | Carvalho, Alda | |
dc.contributor.author | Santos, Carlos Pereira dos | |
dc.contributor.author | Dias, Catia | |
dc.contributor.author | Coelho, Francisco | |
dc.contributor.author | Neto, João Pedro | |
dc.contributor.author | Nowakowski, Richard | |
dc.contributor.author | Vinagre, Sandra | |
dc.date.accessioned | 2015-08-25T14:34:32Z | |
dc.date.available | 2015-08-25T14:34:32Z | |
dc.date.issued | 2014-03 | |
dc.description.abstract | We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved. | por |
dc.identifier.citation | CARVALHO, Alda Cristina Jesus V. Nunes de, [et al] – On lattices from combinatorial game theory modularity and a representation theorem: Finite case. Theroretical Computer Science. ISSN: 0304-3975. Vol. 527 (2014), pp. 37-49 | por |
dc.identifier.doi | 10.1016/j.tcs.2014.01.025 | |
dc.identifier.issn | 0304-3975 | |
dc.identifier.issn | 1879-2294 | |
dc.identifier.uri | http://hdl.handle.net/10400.21/5012 | |
dc.language.iso | eng | por |
dc.peerreviewed | yes | por |
dc.publisher | Elsevier Science BV | por |
dc.subject | Combinatorial game theory | por |
dc.subject | Lattices | por |
dc.subject | Modularity | por |
dc.subject | Representation theorems | por |
dc.title | On lattices from combinatorial game theory modularity and a representation theorem: finite case | por |
dc.type | journal article | |
dspace.entity.type | Publication | |
oaire.citation.endPage | 49 | por |
oaire.citation.startPage | 37 | por |
oaire.citation.title | Theroretical Computer Science | por |
oaire.citation.volume | 527 | por |
person.familyName | Carvalho | |
person.familyName | Dias | |
person.givenName | Alda | |
person.givenName | Cátia | |
person.identifier.ciencia-id | FD18-CBDD-B7C7 | |
person.identifier.ciencia-id | 9211-3BB7-E75E | |
person.identifier.orcid | 0000-0003-2642-4947 | |
person.identifier.orcid | 0000-0001-5803-9168 | |
person.identifier.scopus-author-id | 25027091800 | |
rcaap.rights | closedAccess | por |
rcaap.type | article | por |
relation.isAuthorOfPublication | 214fa21c-bca0-4769-99b0-5f1239d2ea41 | |
relation.isAuthorOfPublication | 93f495c6-8633-4b36-b57c-0c2d5b60eb50 | |
relation.isAuthorOfPublication.latestForDiscovery | 93f495c6-8633-4b36-b57c-0c2d5b60eb50 |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- ON LATTICES FROM COMBINATORIAL GAME THEORY MODULARITY AND A REPRESENTATION THEOREM_FINITE CASE.pdf
- Size:
- 264.78 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: