PROGRAM SCHEMES - BASIC PROPERTIES

III. PROGRAM SCHEMES - BASIC PROPERTIES A. HERBRAND OR FREE INTERPRETATIONS... 

More specifically, the basic notions of a Turing Machine, of computable functions and of undecidable properties are needed for Chapter VI (Decision Problems) the definitions of recursive, primitive recursive and partial recursive functions are helpful for Section F of Chapter IV and two of the proofs in Chapter VI. The basic facts regarding regular sets, context-free languages and pushdown store automata are helpful in Chapter VIII (Monadic Recursion Schemes) and in the proof of Theorem 3.14. For Chapter V (Correctness and Program Verification) it is useful to know the basic notation and ideas of the first order predicate calculus a highly abbreviated version of this material appears as Appendix A. 

The reduction program in an industrial converter, besides the above-mentioned common basic principles, should be considered synthetically according to the structure of reactor, catalyst type and their properties, processes and equipments of synthesis loop and their actual operation conditions. But the basic principle is consistent with the requirements of a catalyst. Therefore, the reduction of different catalysts has different methods and procedures. The scheme of reduction should be designed according to the scheme supplied by R D researcher and manufacturer of the catalyst, and combined with the actual conditions of the plant. 

---