1 paper · 1 filter
Carlos Areces, Miguel Campercholi, Daniel Penazzi +1
In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formula…