1. Let x, y be elements in the Boolean algebra B. Prove that x = y if and only if xy + xy = 0.

2. a. How many rows are needed to construct the (function) table for a Boolean function of n variables?
b. How many different Boolean functions of n variables are there?

3. Let g: B4 →B be defined by g(w, x, y, z) = (wz + xyz)(x + x yz).
a. Find the d.n.f. and c.n.f. for g.
b. Write g as a sum of minterms an d as a product of maxterms (utilizing binary labels).

4. Obtain a minimal-product-of-sums representation for f (w, x, y, z) IIM(0, 1, 2, 4, 5, 10, 12, 13, 14).

5. Let f, g: B5 →B be Boolean functions, where f =∑m(1, 2, 4, 7, x) and g = ∑m(0, 1, 2, 3, y, z, 16, 25). If f ≤ g, what are x, y, z?

Solution Preview

Please see attachment for detailed solution.

1. Let x, y be elements in the Boolean algebra B. Prove that x = y if and only if xy + xy = 0.
If x=y, then xy+ xy = x2+x2= x+x=0
If xy + xy = 0, then xy = 0 and then x=y = 0.

2. a. How many rows are needed to construct the (function) table for a Boolean function of n variables?
There are Boolean functions.

b. How many different Boolean functions of n variables are there?
There are different Boolean functions.

3. Let g: B4 →B be defined by g(w, x, y, z) = (wz ...

Solution Summary

Discrete mathematics for Boolean algebra are discussed. How many rows are needed to construct the function tables for a Boolean function of n variables is provided.

Logic & Set Theory; BooleanAlgebra; Relations & Functions
1. How do we distinguish relations from functions?
2. What sort of relation is friendship, using the human or sociological meaning of the word? Is it necessarily reflexive, symmetric, antisymmetric, or transitive? Explain why it is or is not any of these. What othe

Computer Organization
Digital Logic Circuits(IV)
BooleanAlgebra
Logic Microoperation
Sum of Products Form
It is an explanation for solving the problems of BooleanAlgebra in Computer Organization.
Simplify the following expressions using Booleanalgebra:
(a) A + AB (b) AB +AB' (c) A'BC + AC

Please help answer the following question.
Using your knowledge of free objects in a category, give a definition of a free Booleanalgebra B on a set D. How these compare to free Boolean rings?

In basic algebra the following Theorem is used frequently.
If x,y and z are any three real numbers and if x + z = y + z then x = y.
The analogous statement for sets would read:
Let A, B, and C be any three sets.
If A union B = A union C then B = C.
Prove in detail that this statement is false. (Hint: Giv

BooleanAlgebra and Digital Logic
1. Convert the following binary numbers to their decimal equivalents
a. 1101
b. 0011
c. 11100111
d. 10101011
2. Convert the following decimal numbers to their binary, octal, and hexadecimal equivalents
a. 16
b. 32
c. 48
d. 80
3. Do the following work and answer the fol

6.
a) What does it mean for a set of operators to be functionally complete?
b) Is the set {+, .} functionally complete?
c) Are there sets of single operator that are functionally complete?
Please see the attached file for the fully formatted problems.