Finite Algebras of Relations are Representable on Finite Sets
Andreka, H. ; Hodkinson, I. ; Nemeti, I.
J. Symbolic Logic, Tome 64 (1999) no. 1, p. 243-267 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have the `finite base property' and have decidable universal theories, and that any finite algebra in each class is representable on a finite set.
Publié le : 1999-03-14
Classification:  
@article{1183745703,
     author = {Andreka, H. and Hodkinson, I. and Nemeti, I.},
     title = {Finite Algebras of Relations are Representable on Finite Sets},
     journal = {J. Symbolic Logic},
     volume = {64},
     number = {1},
     year = {1999},
     pages = { 243-267},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745703}
}

Andreka, H.; Hodkinson, I.; Nemeti, I. Finite Algebras of Relations are Representable on Finite Sets. J. Symbolic Logic, Tome 64 (1999) no. 1, pp.  243-267. http://gdmltest.u-ga.fr/item/1183745703/