Abstract

This paper presents an overview of the pioneering contributions of Larisa Maksimova to relevance logics. She is one of the first researchers who set out to methodically study systems of relevance logics, initially, focusing on Ackermann’s $$\varPi '$$ Π ′ of “Rigorous Implication,” and then extending her work to Anderson and Belnap’s systems E of Entailment and R of Relevant Implication, and other related logics. Not only did she develop an algebraic semantics for E, but also we find that a semantic definition of entailment via a ternary accessibility relation appears — the very first time — in an abstract by her.