Abstract
Originally, the categorical calculus of relations was developed using the canonical factorisation in regular categories. More recently, relations restricted to a proper factorisation system have been studied by several authors. In the present paper, we consider the general situation, in which relations are induced by an arbitrary stable factorisation. This extension of the calculus of relations is necessary for a categorical development of strongly constructive (and computational) logic, where non-monic relations come about naturally. In this setting, we analyse the correspondence of the maps, i.e. the total, single-valued relations, and the functions, as given by the arrows in the underlying category.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
