| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: "Armstrong's axioms" augmentation - help plz
"Jan Hidders" <jan.hidders_at_REMOVETHIS.pandora.be> wrote in message news:OfyXd.33305$zl5.3358827_at_phobos.telenet-ops.be...
> Dan wrote:
> > ?? You prove that the rule is correct, but that is not what is disputed. >
What is being disputed here? I thought the question from the OP was whether
the augmentation rule could be expressed as either:
1) {X->Y} |= XZ->YZ
2) {X->Y} |= XZ->Y
By augmentation of the first form of the rule, we get {XZ->Y}|= {XZ->YZ}. That is the extent of the OP's question, as far as I can tell.
I interpreted your answer of *it cannot* to mean that the second inference rule expression was invalid (re: "I don't understand why the second rule can also be stated by..."). But now that I read closer, I think you are asserting something different.
>>> If you replace the first rule with the second you will not
>>> derive all FDs that hold.
>>
>> 1) XZ->Y (given)
>> 2) X->XZ (reflixivity)
>> 3) X->Y (transitivity)
>> 4) XZ-YZ (augmentation)
> > Your step 2 is incorrect (reflexivity says that XZ->X but not that X->XZ) > and in step 4 you assume the rule that you are trying to derive.
Yes. My only defence is dyslexia (in visualizing the subset operator) and
stupidity for including it in the first place, since it really seems
irrevalent.
>
> -- Jan Hidders
Received on Wed Mar 09 2005 - 03:26:58 CST
![]() |
![]() |