Relational Lattices via Duality

DOI10.1007/978-3-319-40370-0_12zbMath1477.06015arXiv1602.08349OpenAlexW2964260489MaRDI QIDQ5739457

Luigi Santocanale

Publication date: 15 July 2016

Published in: Coalgebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.08349

Mathematics Subject Classification ID

Database theory (68P15) Complete lattices, completions (06B23) Applications of universal algebra in computer science (08A70) Representation theory of lattices (06B15)

Related Items (3)

Embeddability into Relational Lattices Is Undecidable ⋮ Relational lattices: from databases to universal algebra ⋮ Embeddability into relational lattices is undecidable

Uses Software

• Prover9
• Mace4
• Waldmeister

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relational lattices: from databases to universal algebra
• Completeness in generalized ultrametric spaces
• An approach to lattice varieties of finite height
• Representability is not decidable for finite relation algebras
• An extension of the Galois theory of Grothendieck
• 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

This page was built for publication: Relational Lattices via Duality