In 1975, R. A. Kowalski introduced the connection graph proof procedure, and in 1981 W. Bibel proved that it is complete and sound. The purpose of this paper is to show concrete examples of completeness and soundness in propositional logic. Two examples are given. One is an example of completeness, and the other is an example of soundness. The reason why they are concrete examples is discussed. When those two examples are generalised, then it is proven that the connection graph proof procedure is complete and sound. However, the proof is not shown in this paper.
A Study on Completeness and Soundness of the Connection Graph Proof Procedure
KJ00004682540.pdf
(341.16KB)
お知らせ