Re: A different definition of MINUS, Part 3



On Dec 21, 9:14 pm, paul c <toledobythe...@xxxxxxxx> wrote:
vadim...@xxxxxxxxx wrote:

...

Next one may compare D&D <AND>&<OR> based system, with RL join&inner
union based one in terms of consistency. Both have arguments in their
favor. D&D system honors distributivity, and De Morgan laws. RL honors
absorption, so that the subset relation can be generalized to be
applicable to any pair of relations. Also RL can express projection as
an (inner) union of a relation with an empty relation. ...

In other words, D&D has absorption when projection is applied and its
union allows deMorgan.  RL has absorption without projection but
projection is defined in terms of a second kind of union.  They both
have distributivity and associativity and defined identity values

Not quite. Both distributivities of ^ over v, and v over ^ are
conditional. Distributivities of + over ^, and ^ over + are universal.

although D&D needs only two identities.  

They don't need additional constants because they don't define
negation. In RL negation is defined with two axioms:

x' ^ x = x ^ R00.
x' v x = x v R11.

Double negation, and De Morgan

x' + y' = (x ^ y)'

are theorems in RL.

As for RL and deMorgan, I
thought Marshall S said at least a year ago that RL supported deMorgan.
  I'm not sure, does it?

x' v y' = (x ^ y)'

is not valid in RL, example

y = {<q=a,>,}
x = {<p=1,>,}

(I changed attribute names in QBQL to not collide with relation names)

.



Relevant Pages

  • Re: Relational Lattice, what is it good for?
    ... I think Spight criteria is sufficient condition for distributivity. ... impossible, such as insert through union, or was the intent merely to ... formal basis for query transformations, ... the easier and the opposite problem to view updates). ...
    (comp.databases.theory)
  • Re: Desc set theory - Projections of product spaces
    ... Consider the class of closed sets PI_1,0 (in the ... work out just like performing union operations on ... the projection of an open set doesn't have to be ...
    (sci.math)
  • Re: Relational Lattice, what is it good for?
    ... Marshall said in one of his notes: "Then join and union are distributive over each other iff and are empty." ... paper ("Dualities among Relational Algebra Operators"): ... distributivity law. ... then Marshall's criteria won't apply. ...
    (comp.databases.theory)
  • Re: Relational Lattice, what is it good for?
    ... I hope to post something on how I came up with the distributivity ... guidelines when I'm done with the book review. ... Marshall said in one of his notes: "Then join and union are ... attributes in common between relations A and B, or A and C, ...
    (comp.databases.theory)
  • Re: Possible Proof of the Lusin-Purves Theorem
    ... > projection map) is closed is much too strong. ... > union of singletons, thus Borel. ... cross Baire space, but its projection is complete analytic. ...
    (sci.math)