Similar Items: On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
- Craig Interpolation for Decidable First-Order Fragments
- Decidability of Querying First-Order Theories via Countermodels of Finite Width
- A Fragment of Dependence Logic Capturing Polynomial Time
- Analytic Tableaux for Simple Type Theory and its First-Order Fragment
- Decidability of extensions of Presburger arithmetic by generalised polynomials
- Lindstrom theorems for fragments of first-order logic