As for the completeness of KT5-models, we have the following theorems.
Theorem 3. (Generalized Completeness Theorem) Any consistent set of well formed formulas is realizable.
Theorem 4. (Completeness and Decidability Theorem) For any , is a theorem of KT5 if and only if is valid in all KT5- models whose cardinality , where n is the cardinality of the finite set .