The complexity of definability by open first-order formulas
Articolo
Articolo
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 formulas) with equality. Given a logic L, the L...
Idioma Inglés
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access