Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures. In this paper, we develop framework whereby the essential properties these categories are captured in purely axiomatic fashion. To end, introduce arboreal categories, which have an intrinsic process structure, al...