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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
