Hi Pat!
I know the wikipedia, wapedia etc. articles
http://wapedia.mobi/en/Relational_algebra
http://en.wikipedia.org/wiki/Relational_algebra
stating:
"Codd's algebra is not in fact complete with respect to first-order logic, he restricted the operands to finite relations only and also proposed restricted support for negation (NOT) and disjunction (OR)"
"Relational algebra actually corresponds to a subset of first-order logic that is Horn clauses without recursion and negation."
I also know Codd's (original) paper from 1970 (unfortunately I don't have the original one from 1969).
What I'm looking for, is a more "serious comparison" of relational algebra and FOL (i.e. expressive power, limitations).
Best regards,
Tom
Quote:
|
Originally Posted by Pat Phelan
Wikipedia is your friend, although some truly demented educational institutions (grossly dysfunctional ones at that) refuse to allow Wikipedia citations. Note that encyclopedias had similar problems for almost fifty years after they became available to the public, so this may not change until the old crew at the institution are eventually replaced with somewhat more technology-aware members.
Check out Tuple Calculus and First Order Logic for a good start.
-PatP
|