Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Relational lattice completeness

Re: Relational lattice completeness

From: Jan Hidders <hidders_at_gmail.com>
Date: 9 Apr 2006 06:31:17 -0700
Message-ID: <1144589477.641043.162310@i40g2000cwc.googlegroups.com>

Mikito Harakiri wrote:
> Jan Hidders wrote:
> > It is. Because we talking about a system where we have a semantical
> > notion of truth for algebraic identities and a syntactical one
> > (derivation from the set of given algebraic identies by applying them
> > to each other) and the question is if these two are the same.
>
> What makes your question hard is that the idea of formal derivation of
> algebraic identities is not mature enough yet.

I gave a nearly formal definition of what I meant with that term. I don't see how it can get more mature.

> Consider the chain of rewritings for push-select-through-project on
> page 7. On step 8 the Spight criteria is applied.

For the fragment that I asked about (look at the definition expression) the Spight rule is irrelevant.

Received on Sun Apr 09 2006 - 08:31:17 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US