A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values. The systems produced are guaranteed to be sound, complete and analytic, and they are also seen to polynomially simulate the truth-table method, thus extending known results about classical logic. Lukasiewicz's 3-valued logic is used throughout as a simple illustrative example. Joint work with M. Volpe and J. Marcos.