Decidability/undecidability of properties in subclasses of conditional term rewriting systems (CTRSs, for short) of natural, join, and oriented types are studied. The properties focused are convertibility, reachability, joinability, con uence, and termination. In particular, it is shown that (1) all of the properties listed above are undecidable for left-linear right-ground CTRSs of each types ...