命题演算两个推理系统的等价性  

On the equivalence between deduction systems H and G in propositional calculus

作　　者：宋方敏[1] 殷熙尧[1] 

机构地区：[1]南京大学计算机科学与技术系,江苏南京210023

出　　处：《计算机工程与科学》2013年第9期104-109,共6页Computer Engineering & Science

基　　金：江苏省自然科学基金资助项目(2011560)

摘　　要：首先介绍命题演算的Gentzen型系统G,然后给出一个命题演算的永真推理系统H,最后证明一个命题在G中可证当且仅当它在H中可证,从而G与H是等价的。Abstract：Firstly, a deduction system G for the propositional calculus in the style of Gentzen is intro- duced. Secondly, a deduction system H for the propositional calculus in the style of Hilbert is proposed. Thirdly, it is proved that G is equivalent to H in the sense that G and H have the same set of theorems.

关 键 词：符号逻辑 命题演算 推理系统 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]