Originally Posted by

**Conway** Chiro, Dan, Archie

I think I finally understand the mistake I have been making. I have spent the last several hours trying to find a solution to Chiro and Dan's last few post. I believe I might have done so...

A = any number

S = any set

Let the ordered pair (x,y) be described as follows...

((z1,z2),(z1,z2)) → (x,y) : ∀A in S

∀A ≠ 0: (z1,z2) = (A,A) = A

∀A = 0: (z1,z2) = (0,1) = 0

combined with the axiom

"Any A in binary operation of multiplication or division is only representing z1, or z2."