From constructibility and absoluteness to computability and domain independence

Arnon Avron

doi:10.1007/11780342_2

From constructibility and absoluteness to computability and domain independence

Arnon Avron^*

^*Corresponding author for this work

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings
Publisher	Springer Verlag
Pages	11-20
Number of pages	10
ISBN (Print)	3540354662, 9783540354666
DOIs	https://doi.org/10.1007/11780342_2
State	Published - 2006
Event	2nd Conference on Computability in Europe, CiE 2006 - Swansea, United Kingdom Duration: 30 Jun 2006 → 5 Jul 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3988 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd Conference on Computability in Europe, CiE 2006
Country/Territory	United Kingdom
City	Swansea
Period	30/06/06 → 5/07/06

Access to Document

10.1007/11780342_2

Cite this

Avron, A. (2006). From constructibility and absoluteness to computability and domain independence. In Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings (pp. 11-20). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3988 LNCS). Springer Verlag. https://doi.org/10.1007/11780342_2

Avron, Arnon. / From constructibility and absoluteness to computability and domain independence. Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. Springer Verlag, 2006. pp. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1489431ad7b041f5b8bb8db8de9027ad,

title = "From constructibility and absoluteness to computability and domain independence",

abstract = "G{\"o}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{\"o}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.",

author = "Arnon Avron",

year = "2006",

doi = "10.1007/11780342_2",

language = "אנגלית",

isbn = "3540354662",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "11--20",

booktitle = "Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings",

note = "2nd Conference on Computability in Europe, CiE 2006 ; Conference date: 30-06-2006 Through 05-07-2006",

}

Avron, A 2006, From constructibility and absoluteness to computability and domain independence. in Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3988 LNCS, Springer Verlag, pp. 11-20, 2nd Conference on Computability in Europe, CiE 2006, Swansea, United Kingdom, 30/06/06. https://doi.org/10.1007/11780342_2

From constructibility and absoluteness to computability and domain independence. / Avron, Arnon.
Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. Springer Verlag, 2006. p. 11-20 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3988 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - From constructibility and absoluteness to computability and domain independence

AU - Avron, Arnon

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746067532&partnerID=8YFLogxK

U2 - 10.1007/11780342_2

DO - 10.1007/11780342_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33746067532

SN - 3540354662

SN - 9783540354666

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 11

EP - 20

BT - Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings

PB - Springer Verlag

T2 - 2nd Conference on Computability in Europe, CiE 2006

Y2 - 30 June 2006 through 5 July 2006

ER -

Avron A. From constructibility and absoluteness to computability and domain independence. In Logical Approaches to Computational Barriers - Second Conference on Computability in Europe, CiE 2006, Proceedings. Springer Verlag. 2006. p. 11-20. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11780342_2

From constructibility and absoluteness to computability and domain independence

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this