Constructibility and decidability versus domain independence and absoluteness
نویسنده
چکیده
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and domain independence of queries in database theory. Our framework and results suggest that domain-independence and absoluteness might be the key notions in a general theory of constructibility, predicativity, and computability.
منابع مشابه
From Constructibility and Absoluteness to Computability and Domain Independence
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 i...
متن کاملTopics in Set Theory
Axiomatics. The formal axiomatic system of ordinary set theory (ZFC). Models of set theory. Absoluteness. Simple independence results. Transfinite recursion. Ranks. Reflection principles. Constructibility. [4] Infinitary combinatorics. Cofinality. Stationary sets. Fodor’s lemma. Solovay’s theorem. Cardinal exponentiation. Beth and Gimel functions. Generalized Continuum Hypothesis. Singular Card...
متن کاملSafety and Domain Independence in Relational and WebQuery Languages , and in Set
We show that there have been common ideas concerning important properties of formulas which were independently developed in the research on query languages and in the mathematical discipline of set theory: safety versus limitation of size, domain-independent versus absoluteness. For each of these pairs we provide common generalizations and show that they are useful for both theories. In the dat...
متن کاملSafety of Formulas in Query Languages , in Arithmetics , and inSet
We show that there have been common ideas concerning important properties of formulas which were independently developed in the research on query languages and in some basic mathematical theories, like set theory and formal number theory: nite-ness versus limitation of size, eeectiveness versus safety, domain-independence versus absoluteness. We provide common generalizations in each case, and ...
متن کاملLevy and set theory
Azriel Levy (1934–) did fundamental work in set theory when it was transmuting into a modern, sophisticated field of mathematics, a formative period of over a decade straddling Cohen’s 1963 founding of forcing. The terms “Levy collapse”, “Levy hierarchy”, and “Levy absoluteness” will live on in set theory, and his technique of relative constructibility and connections established between forcin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 394 شماره
صفحات -
تاریخ انتشار 2008