Relational lattices: from databases to universal algebra

DOI10.1016/J.JLAMP.2015.11.008MaRDI QIDQ299191zbMATH OpenOpenAlexWikidataFDO

Authors Tadeusz Litak, Szabolcs Mikulás, Jan Hidders

Publication date 22 June 2016

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.2015.11.008

zbMATH Keywords

database theorylattice theoryalgebraic logicrelational algebrarelational lattices

Mathematics Subject Classification ID

Knowledge representation (68T30) Database theory (68P15) Logical aspects of lattices and related structures (03G10) Applications of universal algebra in computer science (08A70)

Recommendations

• Relational Lattices
• Relational lattices via duality
• The equational theory of the natural join and inner union is decidable
• Embeddability into relational lattices is undecidable
• Embeddability into relational lattices is undecidable

Cites work

• scientific article; zbMATH DE number 3131078 (Why is no real title available?)
• scientific article; zbMATH DE number 1313604 (Why is no real title available?)
• scientific article; zbMATH DE number 1181276 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 5170267 (Why is no real title available?)
• scientific article; zbMATH DE number 3285229 (Why is no real title available?)
• A relational model of data for large shared data banks
• Algebraization of quantifier logics, an introductory overview
• Categorical logic and type theory
• Cylindric structures and dependencies in relational databases
• Database queries and constraints via lifting problems
• Equational Bases and Nonmodular Lattice Varieties
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Equivalences among Relational Expressions
• Fibrations and universal view updatability
• Fixed-point theory in the varieties \(\mathcal{D}_{n}\)
• Lenses, fibrations and universal translations
• Logic in algebraic form. Three languages and theories
• Polymorphic type inference for the relational algebra
• Recursive unsolvability of a problem of Thue
• Relation algebras by games
• Relational Lattices
• Relational databases and Bell's theorem
• Relational lattices via duality
• Supersolvable lattices
• The decision problem for database dependencies
• The equational theory of CA₃ is undecidable
• The relational model of data and cylindric algebras
• The word problem for cancellation semigroups with zero
• Toward a calculus of concepts
• Varieties of lattices

Cited in

(12)

• Relations as abstract datatypes: An institution to specify relations between algebras
• scientific article; zbMATH DE number 1264546 (Why is no real title available?)
• scientific article; zbMATH DE number 3883649 (Why is no real title available?)
• Relational Lattices
• LATTICES OF STRUCTURE MODELS AND DATABASE SCHEMES
• Embeddability into relational lattices is undecidable
• The equational theory of the natural join and inner union is decidable
• A new formalism for relational algebra
• Relational lattices via duality
• Orbital concept lattices
• Embeddability into relational lattices is undecidable
• The 11th IJCAR automated theorem proving system competition – CASC-J11

This page was built for publication: Relational lattices: from databases to universal algebra

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