Safety, absoluteness, and computability

Arnon Avron, Shahar Lev, Nissan Levi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The semantic notion of dependent safety is a common generalization of the notion of absoluteness used in set theory and the notion of domain independence used in database theory for characterizing safe queries. This notion has been used in previous works to provide a unified theory of constructions and operations as they are used in different branches of mathematics and computer science, including set theory, computability theory, and database theory. In this paper we provide a complete syntactic characterization of general first-order dependent safety. We also show that this syntactic safety relation can be used for characterizing the set of strictly decidable relations on the natural numbers, as well as for characterizing rudimentary set theory and absoluteness of formulas within it.

Original languageEnglish
Title of host publicationComputer Science Logic 2018, CSL 2018
EditorsDan R. Ghica, Achim Jung
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Print)9783959770880
StatePublished - 1 Aug 2018
Event27th Annual EACSL Conference Computer Science Logic, CSL 2018 - Birmingham, United Kingdom
Duration: 4 Sep 20187 Sep 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference27th Annual EACSL Conference Computer Science Logic, CSL 2018
Country/TerritoryUnited Kingdom


  • Absoluteness
  • Computability
  • Decidability
  • Dependent safety
  • Domain independence


Dive into the research topics of 'Safety, absoluteness, and computability'. Together they form a unique fingerprint.

Cite this