Intermediate Borel complexity of model isomorphism

Construct a complete first-order theory in a countable language whose countable-model isomorphism relation lies strictly between equality and equality-plus under Borel reducibility.

Background

Equality and equality-plus are both realized as isomorphism relations of countable models of complete theories. The question asks whether a strictly intermediate complexity can occur.