Embeddability into relational lattices is undecidable

DOI10.1007/978-3-319-57418-9_16zbMATH Open1486.68050OpenAlexW2609335432MaRDI QIDQ5283216FDOQ5283216

Authors: 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

Recommendations

• Embeddability into relational lattices is undecidable
• The equational theory of the natural join and inner union is decidable
• Relational Lattices
• Relational lattices: from databases to universal algebra
• Relational lattices via duality

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A relational model of data for large shared data banks
• Metric spaces, generalized logic, and closed categories
• Completeness in generalized ultrametric spaces
• Relational lattices: from databases to universal algebra
• The equational theory of CA₃ is undecidable
• Relational lattices via duality
• Title not available (Why is that?)
• Embeddability and the Word Problem
• An approach to lattice varieties of finite height
• On modal logics betweenK × K × KandS5 × S5 × S5
• Representability is not decidable for finite relation algebras
• Subdirectly irreducible modal algebras and initial frames
• Title not available (Why is that?)

Cited In (4)

• Relational lattices: from databases to universal algebra
• Embeddability into relational lattices is undecidable
• The equational theory of the natural join and inner union is decidable
• Relational lattices via duality

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283216)