A NaP-preference (necessary and possible preference) on a set A is a pair ( , P ) of binary relations on A such that its necessary component N is a partial preorder, its possible component P is a completion of , and the two components jointly satisfy natural forms of mixed completeness and mixed transitivity. We study additional mixed transitivity properties of a NaP-preference ( , P ) , which ...