A c-Reedy category is a generalization of a Reedy category, even more general than a generalized Reedy category, in which the level morphisms need not even be invertible.
Definition
A c-Reedy category is a category equipped with an ordinal-valued degree function on its objects, and subcategories , , and containing all the objects, such that
.
Every morphism in is level (i.e. its domain and codomain have the same degree).
Every morphism in strictly raises degree, and every morphism in strictly lowers degree.
Every morphism factors as , where and , and the category of such factorizations with connecting maps in is connected.
For any and any degree , the functor is a coproduct of retracts of representables, where denotes the full subcategory of on objects of degree .