Constructibility and decidability versus domain independence and absoluteness

DOI10.1016/j.tcs.2007.12.008zbMath1134.03025OpenAlexW2164475467MaRDI QIDQ2482456

Arnon Avron

Publication date: 16 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.008

zbMATH Keywords

decidabilityabsolutenessset theoryconstructibilitycomputabilitypredicativityChurch's Thesisdomain-independence

Mathematics Subject Classification ID

Database theory (68P15) Decidability of theories and sets of sentences (03B25) Inner models, including constructibility, ordinal definability, and core models (03E45) Theory of numerations, effectively presented structures (03D45)

Related Items

Why Predicative Sets? ⋮ Exact Query Reformulation with First-Order Ontologies and Databases ⋮ POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND ⋮ Applicable Mathematics in a Minimal Computational Theory of Sets ⋮ Unnamed Item ⋮ WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER ⋮ Safety, domain independence and translation of complex value database queries ⋮ Formalizing Scientifically Applicable Mathematics in a Definitional Framework ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set theory. An introduction to independence proofs
• Domain-independent queries on databases with external functions
• Mathematical Knowledge Management
• The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
• The fine structure of the constructible hierarchy
• Consistency of the Continuum Hypothesis. (AM-3)