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.

[1]  C. Smorynski.  The Incompleteness Theorems , 1977 .

[2]  Vladimir Sazonov,et al.  On Bounded Set Theory , 1997 .

[3]  Kenneth Kunen,et al.  Set Theory: An Introduction to Independence Proofs , 2010 .

[4]  Dan Suciu.  Domain-Independent Queries on Databases with External Functions , 1995, ICDT.

[5]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[6]  Michael Kifer,et al.  On Safety, Domain Independence, and Capturability of Database Queries (Preliminary Report) , 1988, JCDKB.

[7]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[8]  A. Avron.  Safety Signatures for First-order Languages and Their Applications , 2004 .

[9]  Fairouz Kamareddine.  Thirty five years of automating mathematics , 2003 .

[10]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[11]  F. Stephan,et al.  Set theory , 2018, Mathematical Statistics with Applications in R.

[12]  P. Welch.  CONSTRUCTIBILITY (Perspectives in Mathematical Logic) , 1986 .

[13]  R. Jensen,et al.  The fine structure of the constructible hierarchy , 1972 .

[14]  Arnon Avron.  Formalizing Set Theory as it Is Actually Used , 2004, MKM.

[15]  I︠U︡riĭ Leonidovich Ershov.  Definability and Computability , 1996 .

[16]  Arnon Avron,et al.  Transitive Closure and the Mechanization of Mathematics , 2003 .

[17]  Bruce W. Rogers.  Consistency of the Continuum Hypothesis , 2005 .

[18]  Henryk Kotlarski,et al.  On the incompleteness theorems , 1994, Journal of Symbolic Logic.

[19]  Dana Scott.  Axiomatic Set Theory, Part 2 , 1974 .

[20]  Robert A. Di Paola.  The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas , 1969, JACM.

[21]  J.F.A.K. van Benthem,et al.  Logic and Scientific Methods , 1997 .

[22]  S. Feferman.  Finitary inductively presented logics , 1994 .