The relational model of data and cylindric algebras
From MaRDI portal
Publication:761801
DOI10.1016/0022-0000(84)90077-1zbMath0557.68067OpenAlexW2062058882WikidataQ55968586 ScholiaQ55968586MaRDI QIDQ761801
Tomasz Imielinski, Witold jun. Lipski
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90077-1
Data structures (68P05) Information storage and retrieval of data (68P20) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items
Intuitionistic interpretation of deductive databases with incomplete information ⋮ Relational lattices: from databases to universal algebra ⋮ A deontic approach to database integrity ⋮ Complexity of equations valid in algebras of relations. I: Strong non-finitizability ⋮ Orbital concept lattices ⋮ Inputs, Outputs, and Composition in the Logic of Information Flows ⋮ Tarski’s Influence on Computer Science ⋮ Unnamed Item ⋮ Algebraization of quantifier logics, an introductory overview ⋮ The contributions of Alfred Tarski to algebraic logic ⋮ A remark of representable positive cylindric algebras ⋮ A framework for comparing query languages in their ability to express Boolean queries ⋮ Cylindric structures and dependencies in relational databases ⋮ Nonapplicable nulls
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cylindric set algebras. Cylindric set algebras and related structures. By L. Henkin, J. D. Monk, and A. Tarski. On cylindric-relativized set algebras. By H. Andreka and I. Nemeti
- Undecidability of the homogeneous formulas of degree 3 of the predicate calculus
- The concept of a linguistic variable and its application to approximate reasoning. I
- The equational theory of CA3 is undecidable
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Optimizing the performance of a relational algebra database interface
- Optimization of Single Expressions in a Relational Data Base System
- Equivalences among Relational Expressions
- Nonfinitizability of classes of representable cylindric algebras
- Nonfinitizability of classes of representable polyadic algebras
- A relational model of data for large shared data banks
- Provability with Finitely Many Variables
