Matrix Taxonomy and Bourn Localization

In a recent paper (Hoefnagel et al. in Theory Appl Categ 38:737–790, 2022), an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices—the so called ‘matrix properties’. In this paper we extend this algorithm to include matrix properties involving pointedness of a category, such as the properties of a category to be unital, strongly unital or subtractive, for example. Moreover, this extended algorithm can also be used to determine whether a given matrix property is the Bourn localization of another, thus leading to new characterizations of Mal’tsev, majority and arithmetical categories. Using a computer implementation of our algorithm, we can display all such properties given by matrices of fixed dimensions, grouped according to their Bourn localizations, as well as the implications between them.