Modular labelled calculi for relevant logics

In this article, we perform a detailed proof theoretic investigation of a wide number of relevant logics by employing the well-established method-ology of labelled sequent calculi to build our intended systems. At the semantic level, we will characterise relevant logics by employing reduced Routley-Meyer models, namely, relational structures with a ternary rela-tion between worlds along with a unique distinct element considered as the real (or actual) world. This paper realizes the idea of building a variety of modular labelled calculi by reflecting, at the syntactic level, semantic informations taken from reduced Routley-Meyer models. Central results include proofs of soundness and completeness, as well as a proof of CUT -admissibility.