This text provides a comprehensive reference to category theory, containing exercises, for researchers and graduates in philosophy, mathematics, computer science, logic and cognitive science. The basic definitions, theorems, and proofs are made accessible by assuming few mathematical pre-requisites but without compromising mathematical rigour. -;This text and reference book on Category Theory, a branch of abstract algebra, is aimed not only at students of Mathematics, but also researchers and students of Computer Science, Logic, Linguistics, Cognitive Science, Philosophy, and any of the other fields that now make use of it. Containing clear definitions of the essential concepts, illuminated with numerous accessible examples, and providing full proofs of all important propositions and theorems, this book aims to make thebasic ideas, theorems, and methods of Category Theory understandable to this broad readership. Although it assumes few mathematical pre-requisites, the standard of mathematical rigour is not compromised. The material covered includes the standard core of categories; functors; natural transformations;equivalence; limits and colimits; functor categories; representables; Yoneda's lemma; adjoints; monads. An extra topic of cartesian closed categories and the lambda-calculus is also provided; a must for computer scientists, logicians and linguists!
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
adjoint functors adjunction arrow f axioms bijective binary products Boolean algebra called cartesian closed category category theory cocomplete coequalizer colimits comonad composition condition congruence consider construction contravariant coproduct counit deﬁned deﬁnition diﬀerent dual duality elements endofunctor equalizer equations equivalence classes equivalence relation example exercise exponential finite ﬁrst forgetful functor free monoid function f functor category functor F given graph Heyting algebra homomorphism h identity arrow iﬀ implies inﬁnite initial algebra initial object injective inverse left adjoint limits locally small logic mathematical monad monic monotone morphism natural isomorphism natural numbers natural transformation notion objects and arrows operation pair poset powerset preserves Proof pullback reader representable functor right adjoint sense Sets Cop Sets/I Similarly slice category small category Speciﬁcally structure subsets surjective T-algebra terminal object theorem topological space ultraﬁlter unique Yoneda embedding Yoneda Lemma