A computational model of relational algebra
A relational logic is constructed in the form of a computational model. Its relationship with boolean algebra is shown and a method of supporting derived domains is introduced (a mechanism of ''modes''). The computational model is rendered intrinsically dynamic by introduction of ''possible worlds''. The proposed method was applied for development and implementation of the LISP/R relational DBMS.
scientific article; zbMATH DE number 4011923