Uniqueness of partially specified multiple-valued Kleenean function

A multiple-valued Kleenean function is a mapping f/sub k/:[0,1]/sup n//spl rarr/[0,1], which is representable by a logic formula consisting n variables, three logical connectives, and any constant value of [0,1]. In this paper, some properties of the partially specified multiple-valued Kleenean functions by a subset A of [0,1] are investigated and the identification problem of logic formula is solved. The main result is a necessary and sufficient condition that a mapping f:A/spl rarr/[0,1] to be a unique Kleenean function.