1 paper · 1 filter
Louwe Kuijer, Tony Tan, Frank Wolter +1
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a f…