期刊文献+

An Algebraic Characterization of Inductive Soundness in Proof by Consistency

An Algebraic Characterization of Inductive Soundness in Proof by Consistency
原文传递
导出
摘要 Kapur and Musser studied the theoretical basis for proof by consistency and ob-tained an inductive completeness result: p q if and only if p = q is true in everyinductive model. However, there is a loophole in their proof for the soundness part:p = q implies p = q is true in every inductive model. The aim of this paper is to give acorrect characterization of inductive soundness from an algebraic view by introducingstrong inductive models. Kapur and Musser studied the theoretical basis for proof by consistency and ob-tained an inductive completeness result: p q if and only if p = q is true in everyinductive model. However, there is a loophole in their proof for the soundness part:p = q implies p = q is true in every inductive model. The aim of this paper is to give acorrect characterization of inductive soundness from an algebraic view by introducingstrong inductive models.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 1995年第3期285-288,共4页 计算机科学技术学报(英文版)
关键词 Proof by consistency inductive soundness strong inductive model congruence relation equation Proof by consistency,inductive soundness,strong inductive model,congruence relation,equation
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部