| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: completeness of the relational lattice
On Jun 28, 3:41 pm, Jan Hidders <hidd..._at_gmail.com> wrote:
> > > I invite you to challenge me to show that it can prove an equation
> > > that holds. Of course you should also check if all these equations can
> > > be derived by you.
One more challenge:
<xy> + S + Q = <xy> + S
where S * [] = [z], and Q header is unconstrained. (I don't see axioms about the lattice bottom element:-) Received on Fri Jun 29 2007 - 11:20:18 CDT
![]() |
![]() |