Logichard
0:00.0
According to Post's Theorem on functional completeness, a set of Boolean connectives is functionally complete if and only if it is not entirely contained within any of the five closed classes of Boolean functions. Which of the following is NOT one of these five closed classes?
According to Post's Theorem on functional completeness, a set of Boolean connectives is functionally complete if and only if it is not entirely contained within any of the five closed classes of Boolean functions. Which of the following is NOT one of these five closed classes?