Deductive and inductive deduce rules' systems for the construction of formal systems
Computing. Information technology
Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia
AbstractThe aid of the article is to compare complexity of deductive (DDRS) and inductive (IDRS) deduce rules' system when constructing formal systems. While using the rule "if q, then P" (DDRS) the construction of formal system is at least accomplished with the help of polynomial algorithms. So the main feature of the programming development now is the constant increase of software cost as far as the complexity of tasks increases. The IDRS (rule "P, if q") does not demand the knowledge of the information transmission addresses and there are no repeated deduce rules. The comparison of DDRS and IDRS permits to conclude: DDRS is more complex in sum then IDRS and does not provide simple linear regulating of algorithm's operators while constructing a formal system. Besides IDRS allows to formalize the process of algorithm's construction in linear mode.