Program-substitution and admissibility of rules in algorithmic logic
Copyright policy )Program-substitution and admissibility of rules in algorithmic logic
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.
- University of Silesia Poland
algorithmic structural completeness, Logic in computer science, algorithmic logic, admissibility of rules, non- deterministic programs, program substitution, Abstract data types; algebraic specification
algorithmic structural completeness, Logic in computer science, algorithmic logic, admissibility of rules, non- deterministic programs, program substitution, Abstract data types; algebraic specification
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!