This is a preview of subscription content, log in via an institution to check access.
Literature Cited
N. N. Nepeivoda, “A method for constructing a correct program from correct subprograms,” Programmirovanie, No. 1, 15–25 (1979).
N. N. Nepeivoda, “A relationship between natural derivation rules and the operators of high-level algorithmic languages,” Dokl. Akad. Nauk SSSR,239, No. 3, 526–529 (1978).
Z. Manna and R. Waldinger, “A deductive approach to program sysnthesis,” Proc. Joint Int. Conf. on Artificial Intelligence, Tokyo (1979), pp. 542–551.
N. A. Shanin, G. V. Davydov, M. Yu. Maslov, et al., Algorithms for Mechanical Construction of a Natural Logical Derivation in Propositional Calculus [in Russian], Nauka, Moscow-Leningrad (1965).
A. I. Tauts, “A semantic model for infinite formulas,” Uch. Zap. Tartu. Univ., No. 355, 7–19 (1975).
A. I. Tauts, “Strong tautology and constructing a countermodel of underivable propositions,” Uch. Zap. Tartu. Univ., No. 390, 29–42 (1976).
Additional information
Translated from Kibernetika, No. 3, pp. 120–128, May–June, 1984.
Rights and permissions
About this article
Cite this article
Tauts, A. Formal deduction with transfinite induction and its transformation for easier program synthesis. Cybern Syst Anal 20, 455–466 (1984). https://doi.org/10.1007/BF01068481
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068481