From constructibility and absoluteness to computability and domain independence

Authors:
Arnon Avron
Affiliations:
School of Computer Science, Tel Aviv University, Tel Aviv, Israel
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 3
Cited 0

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Domain-independent queries on databases with external functions

Theoretical Computer Science - Special issue: database theory
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gödel's main contribution to set theory is his proof that GCH is consistent with ZFC (assuming that ZF is consistent). For this proof he has introduced the important ideas of constructibility of sets, and of absoluteness of formulas. In this paper we show how these two ideas of Gödel naturally lead to a simple unified framework for dealing with computability of functions and relations, domain independence of queries in relational databases, and predicative set theory.