Generalising Conduché's theorem

Abstract In a previous paper (Kasangian and Labella, J Pure Appl Algebra, 2009) we proved a form of Conduché’s theorem for LSymcat-categories, where L was a meet-semilattice monoid. The original theorem was proved in Conduché (CR Acad Sci Paris 275:A891–A894, 1972) for ordinary categories. We showed also that the “lifting factorisation condition” used to prove the theorem is strictly related to the notion of state for processes whose semantics is modeled by LSymcat-categories. In this note we resume the content of Kasangian and Labella (J Pure Appl Algebra, 2009) in order to generalise the theorem to other situations, mainly arising from computer science. We will consider PSymcat-categories, where P is slightly more general than a meet-semilattice monoid, in which the lifting factorisation condition for a PSymcat-functor still implies the existence of a right adjoint to its corresponding inverse image functor.