首页 | 本学科首页   官方微博 | 高级检索  
     检索      

离散数学中与量词有关的推理规则
引用本文:何自强.离散数学中与量词有关的推理规则[J].北京航空航天大学学报,2000,26(4):432-434.
作者姓名:何自强
作者单位:北京航空航天大学 计算机科学与工程系
摘    要:清楚地叙述了自然推理系统中的存在量词消去规则和全称量词引入规则满足的条件,而这些条件在许多离散数学教科书中叙述得相当含糊.与某些教科书中存在量词消去规则只能用于无自由变元的公式不同,按照本文给出的条件,存在量词消去规则也可以用于有自由变元的公式,因而增强了系统的推理能力.引进了解释之间和赋值之间关于公式集的等价性,从而证明了系统是可靠的,即一个证明中的结论是其前提的逻辑推论.

关 键 词:谓词逻辑  逻辑系统  离散数学  可靠性  量词
收稿时间:1998-12-11

Rules of Inference for Quantifiers in Discrete Mathematics
HE Zi-qiang.Rules of Inference for Quantifiers in Discrete Mathematics[J].Journal of Beijing University of Aeronautics and Astronautics,2000,26(4):432-434.
Authors:HE Zi-qiang
Institution:Beijing University of Aeronautics and Astronautics,Dept. of Computer Science and Engineering
Abstract:The conditions satisfied for the existential instantiation and the universal generalization in the natural deduction system are described clear, whereas they are described rather vaguely in many textbooks on discrete mathematics. Contrasting with that the existential instantiation in some textbooks is used only for formulas without free variables, according to the condition we given, it may be also used for formulas with free variables and the ability to reason has increased. Introducing the equivalence between interpretations and the equivalence between assignments with respect to a set of formulas, it is proved that the system is sound, that is, in a proof, the conclusion is a logical consequence of the premises.
Keywords:predicate logic  logical systems  discrete mathematics  soundness  quantifier
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京航空航天大学学报》浏览原始摘要信息
点击此处可从《北京航空航天大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号