Stone type representation theorems via games

ASLAN KHALİFA T., Khaled M. K. M. I.

Colloquium Mathematicum, cilt.155, sa.1, ss.141-155, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 155 Sayı: 1
  • Basım Tarihi: 2019
  • Doi Numarası: 10.4064/cm7368-1-2018
  • Dergi Adı: Colloquium Mathematicum
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.141-155
  • Anahtar Kelimeler: representability, relation algebras, games and networks
  • İstanbul Medipol Üniversitesi Adresli: Evet

Özet

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.