Some Comments on Logic Algorithms

Several aspects of logic algorithm design can be discussed now. We first propose a useful terminology for logic algorithm classification, and then show in what sense minimal cases and non-recursive non-minimal cases, though syntactically similar, are totally different concepts. 

Regarding the decomposition of the induction parameter, we distinguish between the following three categories of logic algorithms  

An intrinsic decomposition reflects a well-founded relation selected via the Intrinsic Heuristic, and an extrinsic or logarithmic decomposition reflects a well-founded relation selected via the Extrinsic Heuristic (see Chapter 4). Sample classifications are given below. 

Other categories could be added here. Sample classifications are given below. 

---