ar X iv : 1 70 5 . 10 11 5 v 1 [ cs . L O ] 2 9 M ay 2 01 7 Conservative Extensions in Guarded and Two - Variable Fragments ∗
نویسندگان
چکیده
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 FO and the guarded fragment GF. We prove that conservative extensions are undecidable in any FO fragment that contains FO or GF (even the three-variable fragment thereof), and that they are decidable and 2ExpTime-complete in the intersection GF of FO and GF.
منابع مشابه
Sensitivity Properties of Intermittent Control
The sensitivity properties of intermittent control are analysed and the conditions for a limit cycle derived theoretically and verified by simulation. 1 ar X iv :1 70 5. 08 22 8v 1 [ cs .S Y ] 2 2 M ay 2 01 7
متن کاملAutomating Image Analysis by Annotating Landmarks with Deep Neural Networks
3 Introduction 3 Materials and Methods 5 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Deep Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Deep Neural Network Architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 Experimental Setup . . . . ...
متن کاملar X iv : 1 70 5 . 03 17 4 v 1 [ m at h . R T ] 9 M ay 2 01 7 PYRAMIDS AND 2 - REPRESENTATIONS
We describe a diagrammatic procedure which lifts strict monoidal actions from additive categories to categories of complexes avoiding any use of direct sums. As an application, we prove that every simple transitive 2-representation of the 2-category of projective bimodules over a finite dimensional algebra is equivalent to a cell 2-representation.
متن کاملar X iv : 1 70 5 . 07 33 9 v 1 [ cs . A I ] 2 0 M ay 2 01 7 Combining tabu search and graph reduction to solve the maximum balanced biclique problem
The Maximum Balanced Biclique Problem is a well-known graph model with relevant applications in diverse domains. This paper introduces a novel algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017