If A is logically equivalent to B, it is not necessary that #(A) = p(B). This technical note proves, however, that if A is in CNF, there exists some logically equivalent DNF, B, such that p(A) = #(B). It is well known that this admits anomalies, such as #(P/x ~P) > 0 and #(P v ~P) < 1. Further, two logically equivalent expressions can have different possibility values. For example, P v Q-~(P ^ ...