next up previous notation contents
Next: 2.9.3 Linear Intervals Up: 2.9 Generalized Interval Arithmetic Previous: 2.9.1 Unification

2.9.2 Three Valued Logic

Boolean logic can be thought of as a very simple number system, given our original framework; a boolean description is a quantitative description. Conjunction and disjunction are often thought of as multiplication and addition, respectively. Both are associative and commutative. Both distributive laws are obeyed:

math6818

tex2html_wrap_inline32719 is an identity for conjunction while tex2html_wrap_inline32721 is an identity for disjunction. Neither operator is invertible. The numbers can be ordered by agreeing that tex2html_wrap_inline32723 .

Three valued logic is isomorphic to tex2html_wrap_inline32725 . The mapping tex2html_wrap_inline32727 ,

math6823

is an isomophism between tex2html_wrap_inline31185 and tex2html_wrap_inline32733 . We let tex2html_wrap_inline32735 denote that b is a valid description of a, where a and b are members of tex2html_wrap_inline32745 :  

math6834

This notation will clarify some later statements by reminding the reader that the arguments of tex2html_wrap_inline32747 are members of tex2html_wrap_inline31185 .

All of the properties of three valued logic can be deduced from this, together with the properties of boolean logic. This is the spirit behind three valued logic: tex2html_wrap_inline32751 symbolizes a lack of knowledge. With further knowledge each tex2html_wrap_inline32751 can be reduced to either tex2html_wrap_inline32721 or tex2html_wrap_inline32719 .


next up previous notation contents
Next: 2.9.3 Linear Intervals Up: 2.9 Generalized Interval Arithmetic Previous: 2.9.1 Unification
Jeff TupperMarch 1996