Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 64, Issue 1 (1999), 243-267.
Finite Algebras of Relations are Representable on Finite Sets
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.
J. Symbolic Logic, Volume 64, Issue 1 (1999), 243-267.
First available in Project Euclid: 6 July 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Andreka, H.; Hodkinson, I.; Nemeti, I. Finite Algebras of Relations are Representable on Finite Sets. J. Symbolic Logic 64 (1999), no. 1, 243--267. https://projecteuclid.org/euclid.jsl/1183745703