Tukey morphisms between finite relations
arXiv:2302.02772 · doi:10.26493/2590-9770.1621.bf9
Abstract
We investigate Tukey morphisms between binary relations, establishing several fundamental lemmas. We then specialize to finite binary relations, using computational methods to classify all binary relations with at most points in the domain and codomain up to bimorphism. Finally we give a construction of finite binary relations with arbitrary dominating number and dual dominating number.