Estimating the complexity of deciphering a threshold functions in a k-valued logic

The problem of finding the coefficients of a linear inequality that separates the sets of zeros and ones of a threshold function f(x) in a k-valued logic of n variables is considered. The coefficients are found by asking a series of questions about whether x is a zero of f(x) It is shown that there exist functions that require not less than C n log n-2 2 k questions, where C n depends only on n.