Re: A Normalization Question
Date: Mon, 19 Jul 2004 21:17:03 +0300
Message-ID: <40fc1028$1_at_post.usenet.com>
- Post for FREE via your newsreader at post.usenet.com ****
"Neo" <neo55592_at_hotmail.com> wrote in message news:4b45d3ad.0407172044.26b7144a_at_posting.google.com...
> If I show a child 'brown' and ask him if it is
> composed of b, r, o, w, n in that order, he would reply yes!
Have you actually tried this ?
With one child or more ?
Have you tried to show him 'brown' and ask him what it is whitout suggesting
the answer ?
> > This is demonstrated by the fact that if you remove all
> > occurrences of the string "brown" from the database then it is still
> > logically derivable from the contents of the database.
> Hmm, please demo how one can still derive this fact if one removes all
> occurances of 'brown' or its equivalents such as 'brown is composed of
> b, r, o, w, n in that order' from a db?
Well, if you ask the db to spell 'brown', it might answer even if 'brown' was not in the db. :-)
> > The reason for this is of course that it is a tautology
> > and can therefore always be logically derived, even from an empty
database.
> One can't derive that 'brown is composed of b, r, o, w, n' from an
> empty db; but a demo could convince me otherwise.
Try this in MS Access:
Query:
SELECT "brown" AS [string], spell('brown') AS spelling;
Module
Function spell(s As String) As String
Dim n As Integer
Dim i As Integer
Dim r As String
n = Len(s)
r = Left(s, 1)
For i = 2 To n
r = r + "," + Mid(s, i, 1)
Next
spell = r
End Function
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
- Usenet.com - The #1 Usenet Newsgroup Service on The Planet! *** http://www.usenet.com Unlimited Download - 19 Seperate Servers - 90,000 groups - Uncensored -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=