某些程式語言(太久沒用，忘了是那些程式語言)是有定義TRUE>FALSE的。
這樣定義的原因是可以用簡單的<=比較運算做出->邏輯運算。

A B A->B A<=B
T T T T
T F F F
F T T T
F F T T

事實上程式語言這種TRUE>FALSE定義是依據Boolean代數的定義來的。
"Logic Synthesis and Verification Algorithms" by Hachtel and Somenzi

"A complemented, distributive lattice is a Boolean Lattice or Boolean Algebra"
What's a lattice:
"A lattice is a poset [partially _ordered_ set] (AXA, <=) [meaning that the Cartesian product of the set A with itself with the result ordered by the less-than or equal relation] in which any two elements have a meet [greatest lower bound] and a join [least upper bound]. Consequently, all finite lattices have a _greatest_ element, denoted by 1 [or true], and a least element 0 [or false], where 1 [true] is an element of set A and 0 [false] is an element of set A."