On the representability of neatly embeddable CA's by cylindric relativized algebras (Q607464)

From MaRDI portal





scientific article; zbMATH DE number 5818037
Language Label Description Also known as
default for all languages
No label defined
    English
    On the representability of neatly embeddable CA's by cylindric relativized algebras
    scientific article; zbMATH DE number 5818037

      Statements

      On the representability of neatly embeddable CA's by cylindric relativized algebras (English)
      0 references
      0 references
      22 November 2010
      0 references
      The classical Neat Embedding Theorem (NET) says that a cylindric algebra \(A \in\) CA\(_\alpha\) is representable by cylindric set algebras if and only if it has the neat embedding property: \(A\) is neatly embeddable into an algebra in CA\(_{\alpha+\varepsilon}\) with \(\varepsilon \geq \omega\). The Resek-Thompson representation theorem has called attention to another kind of representation -- by algebras in Crs\(_\alpha\), i.e., by cylindric relativized set algebras. In the paper, the author finds several counterparts of the classical NET for this kind of representation. In particular, an algebra \(A \in\) CA\(_\alpha\) is representable by an algebra in Crs\(_\alpha \cap\) CA\(_\alpha\) if and only if \(A\) is neatly embeddable into an algebra from a certain ``transit class'' M\(^\alpha_{\alpha+\varepsilon}\) between CA\(_\alpha\) and Crs\(_\alpha \cap\) CA\(_\alpha\). Connections between the obtained results and the Resek-Thomson theorem are also analysed in the paper. The author notes that ideas underlying his proofs and the proof of the theorem in [\textit{H. Andréka} and \textit{R. J. Thompson}, ``A Stone type representation theorem for algebras of relations of higher rank'', Trans. Am. Math. Soc. 309, No. 2, 671--682 (1988; Zbl 0707.03053)] are completely different, and that his results can be adapted to quasi-polyadic and polyadic equality algebras.
      0 references
      cylindric algbra
      0 references
      neat embedding
      0 references
      representability
      0 references
      Resek-Tompson theorem
      0 references

      Identifiers