2000 character limit reached
On the Category of Partial Bijections
Published 5 Mar 2009 in cs.DM | (0903.1017v1)
Abstract: Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an inverse-Baer*-category with closed projections and in which the idempotent split is an exact category. Finally the Noether isomorphism theorems are given for this exact category.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.