Stone type representation theorems via games. (English) Zbl 1529.03279
Summary: 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.
MSC:
| 03G15 | Cylindric and polyadic algebras; relation algebras |
| 06E25 | Boolean algebras with additional operations (diagonalizable algebras, etc.) |
References:
| [1] | R. Hirsch and I. Hodkinson, Relation Algebras by Games, Stud. Logic Found. Math. 147, North-Holland, 2002. · Zbl 1018.03002 |
| [2] | B. J´onsson and A. Tarski, Boolean algebras with operators, Part I, Amer. J. Math. 73 (1951), 891-939. · Zbl 0045.31505 |
| [3] | R. Kramer, Relativized relation algebras, in: H. Andr´eka et al. (eds.), Algebraic Logic (Budapest 1988), Colloq. Soc. J. Bolyai, North-Holland, 1991, 293-349. · Zbl 0749.03047 |
| [4] | R. Maddux, Some varieties containing relation algebras, Trans. Amer. Math. Soc. 272 (1982), 501-526. · Zbl 0515.03039 |
| [5] | M. Marx, S. Mikul´as, I. N´emeti and I. Sain, Investigations in arrow logic, in: M. Marx et al. (eds.), Arrow Logic and Multi-Modal Logic, CSLI Publ., Stanford, CA, 1996, 35-62. |
| [6] | A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941), 73-89. · Zbl 0026.24401 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
