Abstract
A typed category theory is proposed for the abstract description of knowledge and knowledge processing. It differs from the traditional category theory in two directions: all morphisms have types and the composition of morphisms is not necessary a morphism. Two aspects of application of typed category theory are discussed: cones and limits of knowledge complexity classes and knowledge completion with pseudo-functors.
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.
