It is well known that any Boolean function in classical propositional calculus can be learned correctly if the training information system is good enough. In this paper, we extend that result for description logics. | On the possibility of correct concept learning in description logics