摘要
本文给出了计算逻辑理论的拓广——联立递归定义原理和归纳原理。用这些原理可定义更为广泛的函数并证明其上的许多定理,文中给出了UNIFICATION 算法正确性证明中的许多实例,以说明这些原理的使用。
This paper extended simultaneous recursive difinition principle and inductiveprinciple into computational logic theory field.Using these principles,we could definemore extensive functions and prove many theorems.Some examples in the formal proofof correctness of UNIFICATION algorithm are also presented.
出处
《计算机应用与软件》
CSCD
1989年第4期1-7,共7页
Computer Applications and Software
