On the representability of neatly embeddable CA’s by cylindric relativized algebras

1. Andréka H., Thompson R.J.: A Stone type representation theorem for algebras of relations of higher rank. Transaction of Amer. Math. Soc. 309(2), 671–682 (1988)

   Article  MATH  Google Scholar 

2. Andréka, H., Ferenczi, M., Németi, I.: Cylindric-like Algebras and Algebraic Logic. Springer, to appear

3. Ferenczi M.: On diagonals in representable cylindric algebras. Algebra Universalis 41, 187–199 (1999)

   Article  MATH  MathSciNet  Google Scholar 

4. Ferenczi M.: Finitary polyadic algebras from cylindric algebras. Studia Logica 1, 87 (2007)

   MathSciNet  Google Scholar 

5. Ferenczi, M.: The polyadic generalization of the boolean axiomatization of fields of sets. Transaction of American Mathematical Society, to appear

6. Ferenczi, M.: On representation of polyadic equality algebras by polyadic relativized set algebras. Budapest University of Technology, preprint

7. Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras I. North Hollan (1972)

8. Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras II. North Holland (1985)

9. Hirsch R., Hodkinson I.: Step by step building representations in algebraic logic. Journal of Symbolic Logic 62(1), 225–279 (1997)

   Article  MATH  MathSciNet  Google Scholar 

10. Kurucz Á., Németi I.: Representability of pairing relation algebras depends on your ontology. Fundamenta Informaticae 44, 397–420 (2000)

    MATH  MathSciNet  Google Scholar 

11. Németi I., Sayed Ahmed T.: On neat reducts and amalgamation. Bulletin of Symbolic Logic 7, 1 (2001)

    Article  MathSciNet  Google Scholar 

12. Sayed Ahmed T.: Algebraic Logic, where does it stand today?. Bulletin of Symbolic Logic 11(4), 465–516 (2005)

    Article  MATH  MathSciNet  Google Scholar 

13. Sayed Ahmed T.: The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable. Mathematical Logic Quarterly 52(1), 106–112 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references