# Re: Relational symmetric difference is well defined

From: Jan Hidders <hidders_at_gmail.com>
Date: Fri, 15 Jun 2007 05:21:01 -0700
Message-ID: <1181910061.495472.280190_at_c77g2000hse.googlegroups.com>

On 1 jun, 03:40, "V.J. Kumar" <vjkm..._at_gmail.com> wrote:
> Vadim Tropashko <vadimtro_inva..._at_yahoo.com> wrote innews:1180628927.976321.267880@a26g2000pre.googlegroups.com:
>
> > On May 30, 8:52 pm, Marshall <marshall.spi..._at_gmail.com> wrote:
> >> Can you clarify the difference between set containment join and set
> >> equality join? The inverse of join is much on my mind these days.
>
> > Set equality join
>
> > A(x,y)/=B(y,z) is {(x,z)| {y|A(x,y)}={y|A(y,z)} }
>
> > Set containment join
>
> > A(x,y)/=B(y,z) is {(x,z)| {y|A(x,y)}>{y|A(y,z)} }
>
> > where the ">" is "subset of".
>
> The above formulas obviously are no longer first-order expressions.
> Along with the increased expressive power (e.g. it's trivial to define a
> powerset), you will reap the usual drawbacks of the higher order logic.

• Jan Hidders
Received on Fri Jun 15 2007 - 14:21:01 CEST

Original text of this message