Embeddability into relational lattices is undecidable

DOI10.1016/j.jlamp.2018.03.001zbMath1394.68119OpenAlexW2793632772WikidataQ130148156 ScholiaQ130148156MaRDI QIDQ1647970

Luigi Santocanale

Publication date: 27 June 2018

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2018.03.001

zbMATH Keywords

undecidabilitygeneralized ultrametric spaceinner unionnatural joinrelational latticeuniversal product frame

Mathematics Subject Classification ID

Database theory (68P15) Undecidability and degrees of sets of sentences (03D35) Applications of universal algebra in computer science (08A70) Structure theory of lattices (06B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relational lattices: from databases to universal algebra
• On the prevariety of perfect lattices
• Relation algebras
• Subdirectly irreducible modal algebras and initial frames
• Varieties of lattices with geometric descriptions
• Completeness in generalized ultrametric spaces
• Sublattices of complete lattices with continuity conditions
• An approach to lattice varieties of finite height
• Representability is not decidable for finite relation algebras
• The equational theory of CA₃ is undecidable
• Metric spaces, generalized logic, and closed categories
• On modal logics betweenK × K × KandS5 × S5 × S5
• Undecidability of representability as binary relations
• A relational model of data for large shared data banks
• Canonical extensions and relational completeness of some substructural logics
• Relational Lattices via Duality
• Embeddability and the Word Problem

This page was built for publication: Embeddability into relational lattices is undecidable