Constructibility and decidability versus domain independence and absoluteness

DOI10.1016/J.TCS.2007.12.008MaRDI QIDQ2482456zbMATH OpenOpenAlexFDO

Authors 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

absolutenessChurch's Thesiscomputabilityconstructibilitydecidabilitydomain-independencepredicativityset theory

Mathematics Subject Classification ID

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

Recommendations

• Logical Approaches to Computational Barriers
• Dependence logic in pregeometries and -stable theories
• scientific article; zbMATH DE number 4091462
• scientific article; zbMATH DE number 1302871
• On the Question of Absolute Undecidability

Cites work

• Consistency of the Continuum Hypothesis. (AM-3)
• Domain-independent queries on databases with external functions
• scientific article; zbMATH DE number 3861143 (Why is no real title available?)
• scientific article; zbMATH DE number 53543 (Why is no real title available?)
• scientific article; zbMATH DE number 3504972 (Why is no real title available?)
• scientific article; zbMATH DE number 1163985 (Why is no real title available?)
• scientific article; zbMATH DE number 753774 (Why is no real title available?)
• scientific article; zbMATH DE number 753779 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 934359 (Why is no real title available?)
• Mathematical Knowledge Management
• Safety signature for first-order languages and their applications
• Set theory. An introduction to independence proofs
• The fine structure of the constructible hierarchy
• The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas

Cited in

(11)

• Safety, domain independence and translation of complex value database queries
• Exact query reformulation with first-order ontologies and databases
• Weyl reexamined: ``Das Kontinuum 100 years later
• Applicable mathematics in a minimal computational theory of sets
• Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
• Why Predicative Sets?
• scientific article; zbMATH DE number 7533333 (Why is no real title available?)
• Formalizing Scientifically Applicable Mathematics in a Definitional Framework
• Logical Approaches to Computational Barriers
• POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND
• Developing continuity theory in a formal predicative set theory

This page was built for publication: Constructibility and decidability versus domain independence and absoluteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482456)