Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures
From MaRDI portal
Publication:6431344
DOI10.1016/J.ENTCS.2020.02.003zbMath1495.03050arXiv2303.17017WikidataQ113317344 ScholiaQ113317344MaRDI QIDQ6431344
Pablo Ventura, Miguel A. Campercholi, Mauricio Tellechea
Publication date: 29 March 2023
Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures