next up previous
Next: The Puzzle of Unfaithful Up: Kripke-type Semantics Previous: Soundness of KT5-models

Completeness of KT5-models

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 tex2html_wrap_inline410, tex2html_wrap_inline360 is a theorem of KT5 if and only if tex2html_wrap_inline360 is valid in all KT5- models whose cardinality tex2html_wrap_inline564, where n is the cardinality of the finite set tex2html_wrap_inline567.

Yasuko Kitajima
Fri Jun 20 13:39:43 PDT 1997