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

Home -> Community -> Usenet -> comp.databases.theory -> Proof that relational algebra is eqivalent to FOL

Proof that relational algebra is eqivalent to FOL

From: Marshall Spight <marshall.spight_at_gmail.com>
Date: 17 Jul 2005 07:43:56 -0700
Message-ID: <1121611436.233467.72510@g14g2000cwa.googlegroups.com> 





Hi,



I have seen reference (here and elsewhere) to the "common knowledge"
that the relational algebra is equivalent in power to the first
order logic.



I would like to understand this proof, but I can't find any
references to it online. Does anyone have any references?
Books are okay too. I'd really like to understand this issue,
so if anyone has any recommendations for further study, I'd
be interested to hear them.




Marshall
Received on Sun Jul 17 2005 - 09:43:56 CDT












Original text of this message













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