User blog:C7X/CNF Comparison Algorithm

Similar to the one created by Ubersketch a while ago

Is this correct?

Comparison algorithm for \(a<b\):
 * 1) If \(a=0\), then:
 * 2) \(a<b:\iff b\neq0\)
 * 3) Else \(a\neq0\). Therefore \(a=\sum_{i=0}^m\psi(a_i)\). Then:
 * 4) If \(\b=0), then:
 * 5) \(a<b:\iff \bot\)
 * 6) Else \(b\neq0\). Therefore \(b=\sum_{i=0}^n\psi(b_i)\). Then:
 * 7) If \(m=n=0\), then:
 * 8) \(a<b:\iff a_0<b_0\) (Is this correct?)
 * 9) Else \(m\neq0\lor n\neq0\). Then:
 * 10) Set \(k:=0\).
 * 11) If \(a_{m-k}\neq b_{n-k}\), then:
 * 12) \(a<b:\iff a_{m-k}<b_{n-k}\)
 * 13) Else \(a_{m-k}=b_{n-k}\). Then:
 * 14) If \(k=\min(\{m,n\})\), then:
 * 15) \(a<b:\iff m<n\)
 * 16) Else \(k\neq\min(\{m,n\})\). Then:
 * 17) Set \(k:=k+1\).
 * 18) Jump to line 2.2.2.2.