借助一阶逻辑演算有条件地把超限递归原理从序数类推广到具有良基关系的类上。
Let's conditionally generalize principle of transfinite recursion from ordinal number class to class with well-founded relation.
彻基论题：推测有效计算是一个递归函数想法的等价物。
Church's Thesis, conjecturing that effective computation is equivalent to the notion of a "recursive" function.
如果基类是由别的类派生而来，这个规则会递归的应用上去。
This rule is applied recursively if the base class itself is derived from some other class.
应用推荐