We study free variable tableau methods for logics with term declarations. W
e show how to define a substitutivity rule preserving the soundness of the
tableaux and we prove that some other attempts lead to unsound systems. Bas
ed on this rule, we define a sound and complete free variable tableau syste
m and we show how to restrict its application to close branches by defining
a sorted unification calculus. (C) 2000 Academic Press.