12:42 PM
Okay maybe my intuitive answer has a bigger gap than I thought. If the language is finite, then we can pick some P to capture the interpretation of all the symbols in one structure. That would also give us the isomorphism to the other structure.
The language may be infinite, but there are only finitely many possible distinct interpretations of the symbols since there are only n objects, so we should be able to put them into finitely many equivalence classes.
Then run the earlier argument.
Anyway I got to go for now. If my approach is very different from you and your professor's, I'd be glad to see yours.