Program-substitution and admissibility of rules in algorithmic logic (Q1092655)

We show a point of view upon the notions of program-substitution and admissibility of rules which are the tools for proving properties of programs of algorithmic logic and algorithmic logic with non- deterministic programs. The set of theses of algorithmic logic is closed under each program-substitution. By using the substitution rule, a problem of algorithmic structural completeness is formulated as a question about derivability of all structural, finitary and admissible rules. The incompleteness of algorithmic logic strengthened by the substitution rule is proved as well as its algorithmic structural completeness.