Re: Onto a potential relational manipulation language

From: <>
Date: Fri, 12 Dec 2008 12:49:18 -0800 (PST)
Message-ID: <>

On Dec 12, 11:58 am, paul c <> wrote:
> Regarding quantification, I thought Codd's algebra
> included analogies for Exists and Forall in the projection (fundamental,
> can't be defined in terms of the other fundamental ops, ie., REMOVE,
> NAND or NOR, and TCLOSE) and division (defineable in terms of the other
> ops).  Same must be so of D&D A-algebra.  If so, RL must at least have
> quantification since it has a form of projection in its lattice union.

What I was saying that algebraic version of predicate calculus (whatever this might be) doesn't have *explicit* quantifiers. By explicit I mean their syntactic appearance, especially the introduction of auxiliary bind variables. Arguably quantifiers with these bind variables introduce a steep learning curve for anybody who transitioned from propositional to predicate calculus.

> ... such as the
> "multi-relations" Darwen has written about lately (note I'm not saying
> that he advocates them just because he's written about them), where
> tuples in the same structure can have different attributes...

Missing information...yawn. Seriously, I find RL system operating with classic relations be challenging enough, at least I'm not ready to expand the scope yet. From the axiomatic perspective it is interesting what other structures (other than relations) fit into RL axiom system... Received on Fri Dec 12 2008 - 21:49:18 CET

Original text of this message