Article thumbnail
Location of Repository

Conservative Extensions in Guarded and Two-Variable Fragments

By Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider and Frank Wolter


We investigate the decidability and computational complexity of (deductive) conservative extensions in fragments of first-order logic (FO), with a focus on the two-variable fragment FO2 and the guarded fragment GF. We prove that conservative extensions are undecidable in any FO fragment that contains FO2 or GF (even the three-variable fragment thereof), and that they are decidable and 2ExpTime-complete in the intersection GF2 of FO2 and GF

Topics: Conservative Extensions, Decidable Fragments of First-Order Logic, Computational Complexity}, Data processing Computer science
Publisher: LIPIcs - Leibniz International Proceedings in Informatics. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Year: 2017
DOI identifier: 10.4230/LIPIcs.ICALP.2017.108
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.