A note on partial meet package contraction (Q1387804)

For any two sets \(A\) and \(B\) of sentences, let \(A\perp B\) denote the set of inclusion-maximal subsets of \(A\) not implying any element of \(B\). It was shown by \textit{C. E. Alchourrón} and \textit{D. Makinson} [``On the logic of theory change: Contraction functions and their associated revision functions'', Theoria 48, 13-37 (1982; Zbl 0525.03001)] that if \(A\) is closed under logical consequence and \(B\) has exactly one element, then \(A\subseteq \text{Cn} (\cap(A\perp B)\cup B)\). The reviewer [\textit{S. O. Hansson}, ``New operators for theory change'', Theoria 55, 114-132 (1989; Zbl 0722.03028)] generalized this result to the case when \(B\) has any finite number of elements. Here it is shown by way of an elegant example that the property does not hold in general if \(B\) is infinite. This result is important for the generalization of partial meet contraction to multiple inputs.