  We identify the (filter representation of the) logic behind the recent theory
of coherent sets of desirable (sets of) things, which generalise coherent sets
of desirable (sets of) gambles as well as coherent choice functions, and show
that this identification allows us to establish various representation results
for such coherent models in terms of simpler ones.
