I will systematically discuss recent decidability and complexity results for substructural logics. Substructural logics are obtained from familiar logics (think classical or intuitionistic logic) by dropping structural properties such as commutativity, associativity, weakening, or contraction. Infinitely many substructural logics are then definable by adding rules corresponding to further properties. We will see how seemingly small amendments to the proof calculus relate to a world of different complexities.