Embeddability into relational lattices is undecidable

Abstract : The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices. They proposed then lattice theory as an algebraic approach to the theory of databases alternative to the relational algebra. Litak et al. proposed an axiomatization of relational lattices over the signature that extends the pure lattice signature with a constant and argued that the quasiequational theory of relational lattices over this extended signature is undecidable. We prove in this paper that embeddability is undecidable for relational lattices. More precisely, it is undecidable whether a finite subdirectly-irreducible lattice can be embedded into a relational lattice. Our proof is a reduction from the coverability problem of a multimodal frame by a universal product frame and, indirectly, from the representability problem for relation algebras. As corollaries we obtain the following results: the quasiequational theory of relational lattices over the pure lattice signature is undecidable and has no finite base; there is a quasiequation over the pure lattice signature which holds in all the finite relational lattices but fails in an infinite relational lattice.
Complete list of metadatas

Contributor : Luigi Santocanale <>
Submitted on : Wednesday, March 8, 2017 - 10:23:16 AM
Last modification on : Thursday, January 23, 2020 - 6:22:10 PM
Long-term archiving on: Friday, June 9, 2017 - 12:31:45 PM


Files produced by the author(s)






Luigi Santocanale. Embeddability into relational lattices is undecidable. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2018, 97, pp.131-148. ⟨10.1016/j.jlamp.2018.03.001⟩. ⟨hal-01344299v3⟩



Record views


Files downloads