Embeddability into relational lattices is undecidable
From MaRDI portal
Publication:5283216
Recommendations
Cites work
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 758787 (Why is no real title available?)
- scientific article; zbMATH DE number 799006 (Why is no real title available?)
- A relational model of data for large shared data banks
- An approach to lattice varieties of finite height
- Completeness in generalized ultrametric spaces
- Embeddability and the Word Problem
- Metric spaces, generalized logic, and closed categories
- On modal logics betweenK × K × KandS5 × S5 × S5
- Relational lattices via duality
- Relational lattices: from databases to universal algebra
- Representability is not decidable for finite relation algebras
- Subdirectly irreducible modal algebras and initial frames
- The equational theory of CA3 is undecidable
Cited in
(4)
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)