 The other major formal construction is a choice function (selection function) that operates directly on the set of potential outcomes of an operation. Hence, the operation \(K \circ \mathfrak{B}p\) is performed by choosing one among the potential belief sets that contain \(p\) (presumably that which is most choiceworthy, or closest at hand). Operations based on these principles have been axiomatically characterized. Notably, the recovery postulate that creates problems in the AGM framework does not hold in the descriptor revision framework. The application of a choice function to potential belief outcomes is arguably more plausible than its application to possible worlds or remainders, since the latter two entities are logically infinite (if the language is so), and therefore cognitively inaccessible.