 The limiting case when for all sentences \(p\), \(\gamma(K\bot p)\) has exactly one element is called maxichoice contraction. The other limiting case in which \(\gamma(K\bot p) = K\bot p\) whenever \(K\bot p\) is non-empty is called full meet contraction. Both limiting cases are technically useful, but they also both have highly unrealistic properties.