Decidability of Querying First-Order Theories via Countermodels of Finite Width

Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja +1

We propose a generic framework for establishing the decidability of a wide range of logical entailment problems (briefly called querying), based on the existence of countermodels t…