自然推理系统P中的P∧Q■P  

P∧Q■P in Natural Deduction System P

作　　者：孟令江[1] 

机构地区：[1]唐山师范学院数学与信息科学系,河北唐山063000

出　　处：《河北大学学报（自然科学版）》2009年第3期238-240,共3页Journal of Hebei University(Natural Science Edition)

基　　金：河北省自然科学基金资助项目

摘　　要：逻辑推理理论是计算机应用人才必备的重要基础理论之一.在自然推理系统P中,推理依据一般建立在包括P∧Q■P规则在内的多条公理式规则基础上.推理规则是不可逆行的单向过程,而在自然推理系统进行中,信息量只能减少,不可能增加.P∧Q■P恰好表现了信息量减少这一特征.因此,一切推理规则均以P∧Q■P为基础.The theory of logical deduction is one of the most important basic theories which are necessary for the computer application talented persons. In the natural deduction system P, the inference bases are usually built on the base of the rules of many axioms including the rule of P ∧ Q=〉P. Inference rules are an irreversible process. In process, the information content can only reduce, but not increase. P ∧ Q=〉P just show the feature of the reduction of information. So every inference rule is based on P ∧ Q=〉P. implication ; inference system; syllogism; P ∧ Q=〉P rule

关 键 词：蕴含 推理系统 三段论 P∧Q■P规则 

分 类 号：O141[理学—数学]