Advertisement

From Constructibility and Absoluteness to Computability and Domain Independence

  • Arnon Avron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3988)

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.

Keywords

Free Variable Function Symbol Predicate Symbol Transitive Model Ternary Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)MATHGoogle Scholar
  2. 2.
    Avron, A.: Safety Signatures for First-order Languages and Their Applications. In: Hendricks, et al. (eds.) First-Order Logic revisited, pp. 37–58. Logos Verlag, Berlin (2004)Google Scholar
  3. 3.
    Avron, A.: A New Approach to Predicative Set Theory (to appear)Google Scholar
  4. 4.
    Devlin, K.J.: Constructibility. In: Perspectives in Mathematical Logic. Springer, Heidelberg (1984)Google Scholar
  5. 5.
    Gandy, R.O.: Set-theoretic functions for elementary syntax. In: Axiomatic set theory, Part 2, pp. 103–126. AMS, Providence, Rhode Island (1974)CrossRefGoogle Scholar
  6. 6.
    Gödel, K.: The Consistency of the Continuum Hypothesis. In: Annals of Mathematical Studies, vol. 3. Princeton University Press, Princeton (1940)Google Scholar
  7. 7.
    Jensen, R.B.: The Fine Structure of the Constructible Hierarchy. In: Annals of Mathematical Logic, vol. 4, pp. 143–176, 229–308. AMS, Providence, Rhode Island (1971-1974)Google Scholar
  8. 8.
    Kiffer, M.: On Safety Domain independence and capturability of database queries. In: Proc. International Conference on database and knowledge bases, Jerusalem, pp. 405–414 (1988)Google Scholar
  9. 9.
    Kunen, K.: Set Theory, An Introduction to Independence Proofs. North-Holland, Amsterdam (1980)MATHGoogle Scholar
  10. 10.
    Smullyan, R.M.: The Incompleteness Theorems. Oxford University Press, Oxford (1992)MATHGoogle Scholar
  11. 11.
    Ullman, J.D.: Principles of database and knowledge-base systems. Computer Science Press (1988)Google Scholar
  12. 12.
    Suciu, D.: Domain-independent queries on databases with external functions. Theoretical Computer Science 190, 279–315 (1998)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Arnon Avron
    • 1
  1. 1.School of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations