Refutation methods based on the resolution principle are generally applied to a (finite) set of sentences, which must have a series of pre-transformations (prenex normalization, Skolemization and conjunction normaliza...Refutation methods based on the resolution principle are generally applied to a (finite) set of sentences, which must have a series of pre-transformations (prenex normalization, Skolemization and conjunction normalization) before starting the refutation. In this paper, the authors first generalize the concept of abatract consistency class to the most general form-universal abstract consistency class, and prove its universal unifying principle. Then, based on the R-refutation, a universal refutation method is proposed and its soundness and completeness are proved by means of the universal unifying principle. This method can be applied directly to any finite set of wffs without preprocessing the wffs at all so that the refutation procedure is more natural.展开更多
文摘Refutation methods based on the resolution principle are generally applied to a (finite) set of sentences, which must have a series of pre-transformations (prenex normalization, Skolemization and conjunction normalization) before starting the refutation. In this paper, the authors first generalize the concept of abatract consistency class to the most general form-universal abstract consistency class, and prove its universal unifying principle. Then, based on the R-refutation, a universal refutation method is proposed and its soundness and completeness are proved by means of the universal unifying principle. This method can be applied directly to any finite set of wffs without preprocessing the wffs at all so that the refutation procedure is more natural.
