Tuğba Aslan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tuğba Aslan has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Mohamed Khaled
Bahcesehir University
2 shared publications
Latest Publications
- 1 January 2019
- Published by Institute of Mathematics, Polish Academy of Sciences in Colloquium Mathematicum
- Vol. 155 (1) , 141-155
Stone type representation theorems via games
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
- 1 January 2019
- Published by Institute of Mathematics, Polish Academy of Sciences in Colloquium Mathematicum
- Vol. 155 (1) , 141-155
Stone type representation theorems via games
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
- Open Access
Stone type representation theorems via games
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.
Open AccessStone type representation theorems via games
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.