Abstract: For normalization theory of traditional relational databases with FDs constraints, it is important to identify whether a FD is logically implicated by given FDs （i.e. membership problem）, which may help to design an available algorithm of scheme decomposition. For temporal database schemata with temporal dependencies （TFDs） constraints, the usages of multiple time granularities make it more difficult to solve membership problem. Thus some properties for temporal types are discussed, and the conception of the finitely determined set is proposed. In view of finding the finitely determined set of attributes, an available membership algorithm and the relevant proof for its correction are given for TFDs in which the set of left side attributes of each TFD only contains a single attribute.