Embeddability into Relational Lattices Is Undecidable

DOI10.1007/978-3-319-57418-9_16zbMath1486.68050OpenAlexW2609335432MaRDI QIDQ5283216

Luigi Santocanale

Publication date: 21 July 2017

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57418-9_16

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
• Relational lattices: from databases to universal algebra
• Subdirectly irreducible modal algebras and initial frames
• Completeness in generalized ultrametric spaces
• 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
• A relational model of data for large shared data banks
• Relational Lattices via Duality
• Embeddability and the Word Problem

This page was built for publication: Embeddability into Relational Lattices Is Undecidable