After having recalled the content of the first part, I will present a framework developed in the context of logic that allows one to measure the complexity of classification problems in mathematics. I will then explain how the "definable" algebraic invariants developed with Bergfalk and Panagiotopoulos can be used to obtain information on the complexity of classification problems mentioned in the title.