Stone type representation theorems via games
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2018
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916139215355904 |
|---|---|
| author | Aslan, Tuğba Khaled, Mohamed |
| author_facet | Aslan, Tuğba Khaled, Mohamed |
| contents | The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original proofs. We give direct constructions for all cases, whereas the original proofs reduced the problem to only one case. The proof herein is combinatorial and it uses some techniques from game theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1811_02311 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Stone type representation theorems via games Aslan, Tuğba Khaled, Mohamed Logic Primary 03G15, Secondary 06E25, 03B45 The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original proofs. We give direct constructions for all cases, whereas the original proofs reduced the problem to only one case. The proof herein is combinatorial and it uses some techniques from game theory. |
| title | Stone type representation theorems via games |
| topic | Logic Primary 03G15, Secondary 06E25, 03B45 |
| url | https://arxiv.org/abs/1811.02311 |