Publication Date
7-2000
Abstract
Several universal approximation and universal representation results are known for non-Boolean multi-valued logics such as fuzzy logics. In this paper, we show that similar results can be proven for multi-valued Boolean logics as well.
Comments
UTEP-CS-00-28.
Published in the International Journal of Intelligent Systems, 2001, Vol. 16, pp. 647-653.