Universal first-order logic is superfluous for NL, P, NP and CO NP

Article

Abstract: In this work we continue the syntactic study of completeness that began with the works of Immerman a

Palabras claves:

Complexity classes, descriptive complexity, First order projections, NP completeness, Problems and reductions

Autores:

Bonet B., Nerio Borges

Fuentes:

scopus