 Tracking may be a desirable property, but are there any architectures that exhibit it? Lin and Kelly (2012) answer this question affirmitively. Since Bayesian conditioning is taken for granted, Lin and Kelly must specify two things: a qualitative revision operation and an acceptance rule that jointly track conditioning. We turn now to the details of their proposal. As usual, let \(W\) be a set of worlds. A  question  \({\bf Q}\) is a partition of \(W\) into a countable collection of mutually exhaustive propositions \(H_1, H_2, \ldots,\) which are the complete  answers to \({\bf Q}.\) The partial belief function \(\Pr\) is defined over the algebra of propositions \({\bf A}\) generated by \({\bf Q}.\) Let \(\prec\) be a well-founded, strict partial order over the answers to \({\bf Q}\). (A strict partial order is  well-founded iff every subset of the order has a least element.) This is interpreted as a  plausibility ordering, where \(H_i \prec H_j\) means that \(H_i\) is strictly  more  plausible than \(H_j\). Every plausibility order \(\prec\) gives rise to a deductively cogent belief state \(\Bel_\prec\) by letting \(\neg H_i\in \Bel_\prec\) iff there is some \(H_j\) strictly more plausible than \(H_i\) and closing under logical consequence. In other words, \(\cap \Bel_\prec\) is the disjunction of the minimal elements in the plausibility order. 