Deciding Quantifier-free Definability in Finite Algebraic Structures
Miguel A. Campercholi, Mauricio Tellechea, Pablo Ventura · Electronic Notes in Theoretical Computer Science · 2020
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present a decision algorithm based on a semantical characterization of definable relations as those preserved by isomorphisms of substructures. Our approach also includes the design of an algorithm that computes the isomorphism type of a tuple in a finite algebraic structure. Proofs of soundness and completeness of the algorithms are presented, as well as empirical tests assessing their performances.