Find the values of these expressions.

$$\begin{array}{llll}{\text { a) } 1 \cdot \overline{0}} & {\text { b) } 1+\overline{1}} & {\text { c) } \overline{0} \cdot 0} & {\text { d) }(1+0)}\end{array}$$

Adithya R.

Numerade Educator

Find the values, if any, of the Boolean variable $x$ that satisfy these equations.

$$\begin{array}{ll}{\text { a) } x \cdot 1=0} & {\text { b) } x+x=0} \\ {\text { c) } x \cdot 1=x} & {\text { d) } x \cdot \overline{x}=1}\end{array}$$

Wen Z.

Numerade Educator

a) Show that $(1 \cdot 1)+(\overline{0 \cdot 1}+0)=1$

b) Translate the equation in part (a) into a propositional equivalence by changing each 0 into an $\mathbf{F}$ , each 1 into a $\mathbf{T}$ , each Boolean sum into a disjunction, each Boolean product into a conjunction, each complementation into a negation, and the equals sign into a propositional equivalence sign.

Adithya R.

Numerade Educator

a) Show that $(\overline{1} \cdot \overline{0})+(1 \cdot \overline{0})=1$

b) Translate the equation in part (a) into a propositional equivalence by changing each 0 into an $\mathbf{F}$ , each 1 into a $\mathbf{T}$ , each Boolean sum into a disjunction, each Boolean product into a conjunction, each complementation into a negation, and the equals sign into a propositional equivalence sign.

Wen Z.

Numerade Educator

Use a table to express the values of each of these Boolean functions.

a) $F(x, y, z)=\overline{x} y$

b) $F(x, y, z)=x+y z$

c) $F(x, y, z)=x \overline{y}+\overline{(x y z)}$

d) $F(x, y, z)=x(y z+\overline{y} \overline{z})$

Adithya R.

Numerade Educator

Use a table to express the values of each of these Boolean functions.

a) $F(x, y, z)=\overline{z}$

b) $F(x, y, z)=\overline{x} y+\overline{y} z$

c) $F(x, y, z)=x \overline{y} z+\overline{(x y z)}$

d) $F(x, y, z)=\overline{y}(x z+\overline{x} \overline{z})$

Wen Z.

Numerade Educator

Use a 3 -cube $Q_{3}$ to represent each of the Boolean functions in Exercise 5 by displaying a black circle at each vertex that corresponds to a 3 -tuple where this function has the value $1 .$

Adithya R.

Numerade Educator

Use a 3 -cube $Q_{3}$ to represent each of the Boolean functions in Exercise 6 by displaying a black circle at each vertex that corresponds to a 3 -tuple where this function has the value $1 .$

Wen Z.

Numerade Educator

What values of the Boolean variables $x$ and $y$ satisfy $x y=x+y ?$

Adithya R.

Numerade Educator

Prove the absorption law $x+x y=x$ using the other laws in Table $5 .$

Adithya R.

Numerade Educator

Show that $F(x, y, z)=x y+x z+y z$ has the value 1 if and only if at least two of the variables $x, y,$ and $z$ have the value $1 .$

Wen Z.

Numerade Educator

Show that $x \overline{y}+y \overline{z}+\overline{x} z=\overline{x} y+\overline{y} z+x \overline{z}$

Adithya R.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the law of the double complement.

Wen Z.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the idempotent laws.

Sam S.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the identity laws.

Wen Z.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the domination laws.

Sam S.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the commutative laws.

Wen Z.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the associative laws.

Sam S.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the first distributive law in Table $5 .$

Wen Z.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify De Morgan's laws.

Sam S.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the unit property.

Wen Z.

Numerade Educator

Exercises $14-23$ deal with the Boolean algebra $\{0,1\}$ with addition, multiplication, and complement defined at the beginning of this section. In each case, use a table as in Example 8 .

Verify the zero property.

Sam S.

Numerade Educator

The Boolean operator $\oplus,$ called the $X O R$ operator, is defined by $1 \oplus 1=0,1 \oplus 0=1,0 \oplus 1=1,$ and $0 \oplus 0=0$.

Simplify these expressions.

$$\begin{array}{ll}{\text { a) } x \oplus 0} & {\text { b) } x \oplus 1} \\ {\text { c) } x \oplus x} & {\text { d) } x \oplus \overline{x}}\end{array}$$

Wen Z.

Numerade Educator

The Boolean operator $\oplus,$ called the $X O R$ operator, is defined by $1 \oplus 1=0,1 \oplus 0=1,0 \oplus 1=1,$ and $0 \oplus 0=0$.

Show that these identities hold.

a) $x \oplus y=(x+y)(x y)$

b) $x \oplus y=(x \overline{y})+(\overline{x} y)$

Adithya R.

Numerade Educator

The Boolean operator $\oplus,$ called the $X O R$ operator, is defined by $1 \oplus 1=0,1 \oplus 0=1,0 \oplus 1=1,$ and $0 \oplus 0=0$.

Show that $x \oplus y=y \oplus x$

Wen Z.

Numerade Educator

The Boolean operator $\oplus,$ called the $X O R$ operator, is defined by $1 \oplus 1=0,1 \oplus 0=1,0 \oplus 1=1,$ and $0 \oplus 0=0$.

Prove or disprove these equalities.

a) $x \oplus(y \oplus z)=(x \oplus y) \oplus z$

b) $x+(y \oplus z)=(x+y) \oplus(x+z)$

c) $x \oplus(y+z)=(x \oplus y)+(x \oplus z)$

Check back soon!

Find the duals of these Boolean expressions.

$$\begin{array}{ll}{\text { a) } x+y} & {\text { b) } \overline{x} \overline{y}} \\ {\text { c) } x y z+\overline{x} \overline{y} \overline{z}} & {\text { d) } x \overline{z}+x \cdot 0+\overline{x} \cdot 1}\end{array}$$

Wen Z.

Numerade Educator

Suppose that $F$ is a Boolean function represented by a Boolean expression in the variables $x_{1}, \ldots, x_{n} .$ Show that $F^{d}\left(x_{1}, \ldots, x_{n}\right)=\overline{F\left(\overline{x}_{1}, \ldots, \overline{x}_{n}\right)}$

Check back soon!

Show that if $F$ and $G$ are Boolean functions represented by Boolean expressions in $n$ variables and $F=G$ , then $F^{d}=G^{d}$ , where $F^{d}$ and $G^{d}$ are the Boolean functions represented by the duals of the Boolean expressions representing $F$ and $G,$ respectively. [Hint: Use the result of

Exercise $29 . ]$

Wen Z.

Numerade Educator

How many different Boolean functions $F(x, y, z)$ are there such that $F(\overline{x}, \overline{y}, \overline{z})=F(x, y, z)$ for all values of the Boolean variables $x, y,$ and $z ?$

Check back soon!

How many different Boolean functions $F(x, y, z)$ are there such that $F(\overline{x}, y, z)=F(x, \overline{y}, z)=F(x, y, \overline{z})$ for all values of the Boolean variables $x, y,$ and $z ?$

Wen Z.

Numerade Educator

Show that you obtain De Morgan's laws for propositions (in Table 6 in Section 1.3 ) when you transform De

Morgan's laws for Boolean algebra in Table 6 into logical equivalences.

Check back soon!

Show that you obtain the absorption laws for propositions (in Table 6 in Section 1.3 ) when you transform the absorption laws for Boolean algebra in Table 6 into logical equivalences.

Wen Z.

Numerade Educator

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, the idempotent laws $x \vee x=x$ and $x \wedge x=x$ hold for every element $x .$

Check back soon!

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, every element $x$ has a unique complement $\overline{x}$ such that $x \vee \overline{x}=1$ and $x \wedge \overline{x}=0$ .

Wen Z.

Numerade Educator

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, the complement of the element 0 is the element 1 and vice versa.

Check back soon!

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Prove that in a Boolean algebra, the law of the double complement holds; that is, $\overline{\overline{x}}=x$ for every element $x .$

Wen Z.

Numerade Educator

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that De Morgan's laws hold in a Boolean algebra. That is, show that for all $x$ and $y, \overline{(x \vee y)}=\overline{x} \wedge \overline{y}$ and $\frac{1}{(x \wedge y)}=\overline{x} \vee \overline{y}$

Check back soon!

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, the modular properties hold. That is, show that $x \wedge(y \vee(x \wedge z))=(x \wedge y) \vee(x \wedge$ $z )$ and $x \vee(y \wedge(x \vee z))=(x \vee y) \wedge(x \vee z)$

Wen Z.

Numerade Educator

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, if $x \vee y=0,$ then $x=0$ and $y=0,$ and that if $x \wedge y=1,$ then $x=1$ and $y=1$

Check back soon!

In Exercises $35-42,$ use the laws in Definition 1 to show that the stated properties hold in every Boolean algebra.

Show that in a Boolean algebra, the dual of an identity, obtained by interchanging the $\mathrm{V}$ and $\wedge$ operators and interchanging the elements 0 and $1,$ is also a valid identity.

Wen Z.

Numerade Educator