谓词逻辑推理中证明方法的判定

The Decidability of Proof Method in the Predicate Logic Inference

数理逻辑是《离散数学》的难点之一。主要有两个原因,其一是内容比较抽象且方法较独特;其二是题型以证明题居多,大多数证明题涉及到的知识面较广,习题较难。而谓词逻辑是命题逻辑的推广,其灵活性就更大,故很难掌握。本文总结了几种谓词逻辑推理的判定方法和注意事项,以帮助掌握证明题的证明。结合适当的例题讲解,帮助学生进行逻辑思维能力的训练,培养分析问题和解决问题的能力。

Mathematical logic is one of the difficulties of “Discrete Mathematics”. There are two reasons, one is that mathematical logic is more abstract and its methods are quite unique; the second reason is that most of its subjects are proof ones, the knowledge it involves is so extensive that it is difficult to be worked out. Moreover, predicate logic is the generalization of propositional logic and possesses larger flexibility, so it is very difficult for students to grasp. This paper summarizes several decidabilities for predicate logic inference and several points for attention, which may help people in proof of such subjects. In the teaching of mathematical logic course, we can improve the students＇ ability of logic thinking by well- chosen examples,and train their ability to analyze and solve problems.