The combination of Fuzzy Logics and Description Logics has been investigated for at least two decades because such fuzzy DLs can be used to formalize imprecise concepts. In particular, tableau algorithms for crisp Description Logics have been extended to reason also with their fuzzy counterparts. It has turned out, however, that in the presence of general concept inclusion axioms this extension is less straightforward than thought. In fact, a number of tableau algorithms claimed to deal correctly with fuzzy DLs with (...) GCIs have recently been shown to be incorrect. In this paper, we concentrate on fuzzy \, the fuzzy extension of the well-known DL \. We present a terminating, sound, and complete tableau algorithm for fuzzy \ with arbitrary continuous t-norms. Unfortunately, in the presence of GCIs, this algorithm does not yield a decision procedure for consistency of fuzzy \ ontologies since it uses as a sub-procedure a solvability test for a finitely represented, but possibly infinite, system of inequations over the real interval [0,1], which are built using the t-norm. In general, it is not clear whether this solvability problem is decidable for such infinite systems of inequations. This may depend on the specific t-norm used. In fact, we also show in this paper that consistency of fuzzy \ ontologies with GCIs is undecidable for the product t-norm. This implies, of course, that for the infinite systems of inequations produced by the tableau algorithm for fuzzy \ with product t-norm, solvability is in general undecidable. We also give a brief overview of recently obtained decidability results for fuzzy \ w.r.t. other t-norms. (shrink)