Program-substitution and admissibility of rules in algorithmic logic (Q1092655)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Program-substitution and admissibility of rules in algorithmic logic |
scientific article; zbMATH DE number 4020468
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Program-substitution and admissibility of rules in algorithmic logic |
scientific article; zbMATH DE number 4020468 |
Statements
Program-substitution and admissibility of rules in algorithmic logic (English)
0 references
1988
0 references
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.
0 references
program substitution
0 references
admissibility of rules
0 references
algorithmic logic
0 references
non- deterministic programs
0 references
algorithmic structural completeness
0 references
