A completeness proof for a regular predicate logic with undefined truth value (Q6100982): Difference between revisions

The authors develop semantics for an extension of \textit{S. C. Kleene}'s three-valued logic (see [J. Symb. Log. 3, 150--155 (1938; Zbl 0020.33803; JFM 64.0932.03); Introduction to metamathematics. Amsterdam: North-Holland Publishing Co.; Groningen: P. Noordhoff N. V. (1952; Zbl 0047.00703)]) to first-order predicate language. They prove soundness and completeness theorem, followed by a very good motivation. The completeness proof is based on traditional \textit{L. Henkin}'s construction [J. Symb. Log. 14, 159--166 (1949; Zbl 0034.00602)]. It seems that this approach can be applied to many other three-valued logics.