how could i express using only the operator NOR (in logic) the rest of operation NOT(x) AND(x,y) OR(x,y) that is how i could prove that the Logic operator NOR is functionally complete
See if you can figure out NOT in terms of NOR (this is not too hard), then use DeMorgan's laws to figure out how to write AND and OR using NOT and NOR.