Answer Happy

Posted: **Thu May 12, 2022 10:05 am**

: B For A Classical Logic Knowledgebase Let Mc A Be The Set Of Maximally Consistent Subsets Of A And Let Mi A Be The S 1 (31.85 KiB) Viewed 26 times

b. For a classical logic knowledgebase, let MC(A) be the set of maximally consistent subsets of A and let MI(A) be the set of minimally inconsistent subsets of A. Does the following hold? If so, give a proof. If not, give a counterexample. n MC(A) = A - UMI(A) [10 marks]