i dont know how to ask my question but here it is...
i have implementation of "NOT" and "True" and "false",but if i want to have "xnor" according to the example beneath:
(true) T--->λx.λy.x
(false) F----> λx.λy.y
(true) Q =((TQ)P) => ((λX.λY.X Q)P= (λY.Q)P=Q (false) P =((FQ)P) => ((λX.λY.Y Q)P= (λY.Y)P=P
Not ---> λx.((xF)T)
Not T ---> λx.((xF)T) T = ((TF)T=F
Not F ---> λx.((xF)T) F = ((FF)T=T
what "xnor" will be according to these examples? i have "not" ,"true" and "false",how i can get "xnor" or "or" or "and" ?(cause i can get to the Xnor with at least "or" and "and" )