Relational Semantics for Databases and Predicate Calculus
Abstract
The relational data model requires a theory of relations in which tuples are not only manysorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that are adequate for database use. The operations are similar to those of Codd's relational algebra, but differ in being based on a mathematically adequate theory of relations. The semantics of predicate calculus, being oriented toward the concept of satisfiability, is not suitable for relational databases. We develop an alternative semantics that assigns relations as meaning to formulas with free variables. This semantics makes the classical predicate calculus suitable as a query language for relational databases.
 Publication:

arXiv eprints
 Pub Date:
 February 2012
 arXiv:
 arXiv:1202.0474
 Bibcode:
 2012arXiv1202.0474K
 Keywords:

 Computer Science  Databases;
 Computer Science  Logic in Computer Science;
 F.4.1;
 H.2.1;
 H.2.4
 EPrint:
 18 pages, 8 figures. arXiv admin note: text overlap with arXiv:cs/0607039