Conservative Extensions in Guarded and Two-Variable Fragments.

DOI10.4230/LIPIcs.ICALP.2017.108zbMath1442.03006arXiv1705.10115OpenAlexW2962905563MaRDI QIDQ5111440

No author found.

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1705.10115

zbMATH Keywords

computational complexityconservative extensionsdecidable fragments of first-order logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ Logical separability of labeled data examples under ontologies

This page was built for publication: Conservative Extensions in Guarded and Two-Variable Fragments.