We show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds.
CITATION STYLE
Allender, E., Balcazar, J., & Immerman, N. (1993). A first-order isomorphism theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 163–174). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_19
Mendeley helps you to discover research relevant for your work.