Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Set Theoryhard
0:00.0

Let UUU be a universal set, and let A,B⊆UA, B \subseteq UA,B⊆U. We define the NAND operator on sets as A↑B=(A∩B)′A \uparrow B = (A \cap B)'A↑B=(A∩B)′. Which of the following set-theoretic expressions is equivalent to the set difference A∖BA \setminus BA∖B using only the ↑\uparrow↑ operator?