Agreement reducibility
Rachel Epstein, Karen Lange · Mathematical logic quarterly · 2020
Abstract We introduce agreement reducibility and highlight its major features. Given subsets A and B of , we write if there is a total computable function satisfying for all , . We shall discuss the central role plays in this reducibility and its connection to strong‐hyper‐hyper‐immunity. We shall also compare agreement reducibility to other well‐known reducibilities, in particular s1‐ and s‐reducibility. We came upon this reducibility while studying the computable reducibility of a class of equivalence relations on based on set‐agreement. We end by describing the origin of agreement reducibility and presenting some results in that context.