Program-substitution and admissibility of rules in algorithmic logic

From MaRDI portal

DOI10.1007/BF02737110MaRDI QIDQ1092655zbMATH OpenOpenAlexFDO

Authors Andrzej Biela

Publication date 1988

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02737110


zbMATH Keywords

admissibility of rulesalgorithmic logicalgorithmic structural completenessnon- deterministic programsprogram substitution

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)




Review text

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.


Recommendations


Cites work


Cited in
(4)








This page was built for publication: Program-substitution and admissibility of rules in algorithmic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092655)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Program-substitution_and_admissibility_of_rules_in_algorithmic_logic&oldid=66939768"
Powered by MediaWiki