Question

(11) (3+3+5+5+ 2) Define functional completeness. Show that x + y = (x + y) + (x + y), x •y = (x + x) + (y + y), ī= (x + x) I

0 0
Add a comment Improve this question Transcribed image text
Answer #1

A functional completeness may be defined as a set of logical connectives Or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression. A well-known complete set of connectives is {AND, NOT}, consisting of binary conjunction and negation. Each of the singleton sets {NAND} and {NOR} is functionally complete.

A gate Or set of gates which is functionally complete can be called a universal gates.

In logic, typically take as premitive some subset text of connectives; conjunction, disjunction, negation, material conditional.

x+ y as (x y) J ( x vy) using truth table У x + Y ху X+Y (ody) & ( 0 JYJ 0 0 1 1 O 1 1 о 1 1 1 O O O 1 1 1 1 1 b) Hence (x+ (

Add a comment
Know the answer?
Add Answer to:
(11) (3+3+5+5+ 2) Define functional completeness. Show that x + y = (x + y) +...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT