Talk:Codd's theorem
Appearance
	
	
| This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:  | ||||||||||||||||||||||||||||||||||||||||||||||||
 
 
 
  | ||||||||||||||||||||||||||||||||||||||||||||||||
Untitled
[edit]I added a first version of this article, but over time, the discussion of domain independence will have to be extended, this may be too cryptic. Also, a discussion of range-restriction, the usual method of syntactically enforcing domain independence, should be added.
-- cdrdata —Preceding unsigned comment added by Cdrdata (talk • contribs) 09:42, 17 August 2008 (UTC)
Proof
[edit]Is it a constructive proof? I had a course in databases, and learned about Relational algebra and Datalog, which is a logic programming language, and therefore quite similar to the relational calculus. We had the transition from the RA to Datalog, which make it a constructive proof to the one-side equivalence of RA to Datalog. Galzigler (talk) 12:18, 30 November 2019 (UTC)
Categories: 
- Start-Class Computing articles
 - Unknown-importance Computing articles
 - Automatically assessed Computing articles
 - All Computing articles
 - Start-Class Computer science articles
 - Low-importance Computer science articles
 - WikiProject Computer science articles
 - Start-Class mathematics articles
 - Low-priority mathematics articles
 
