The Gateway to Computer Science Excellence
+5 votes
Provide short answers to the following questions:

Show that {NOR} is a functionally complete set of Boolean operations.
in Digital Logic by Boss (30.7k points) | 432 views

2 Answers

+13 votes
Best answer
Functionally complete set is by which you can perform all operations. So, if any logical set is able to implement the operation {And ., NOT}  or {OR, NOT} ; it is known as functionally complete .

Now come to NOR gate .

A(NOR)B= (A+B)'

A(NOR)A =(A+A)' =(A)'  , so we can perform the NOT operation .

(A+B)' NOR (A+B)' =((A+B)' + (A+B)')' =((A+B)')' =(A+B) , so OR operation is also performed successfully .

So, NOR is the functionally complete .
by Active (4.1k points)
edited by
+1 vote

WE Know that we can derive any GAte from NAND,NOR, so all boolean functions can be derived from NOR

so it is functionally complete

by Boss (18k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
104,683 users