Functors solve the connection problem for nonreductivism

Abstract This paper shows that functors can be used to solve the connection problem for grounding-based nonreductivism. Unlike previous attempts (such as Miller’s Essentialist Non-Reductivism and von Solodkoff’s Straightening Prioriy Out ), I show that nonreductivism is fully compatible with the central assumption of the connection problem, namely the so-called determination constraint.