The Shannon expansion in symbolic computation tree logic is generalized. In a n-valued Łukasiewicz logic system, Łn, the expansion of n-valued McNaughton functions which are induced by logical formulae is studied. The quasi disjunctive normal form and quasi conjunctive normal form of m-ary n-valued McNaughton functions, and the counting problems of m-ary n-valued McNaughton functions are given. In n-valued Łukasiewicz logic system Łn, the construction of formulae and counting problems of their logic equivalence class are provided.