This is a preview of subscription content, log in via an institution to check access.
Literature Cited
L.E.J. Brouwer, “Intuitionism and formalism,” Bull. Am. Math. Soc.,20 (1913).
A. Heyting, “Die formale Regeln der intuitionistische Logik,” Sitzungsber. Preuss. Akad. Wiss., Berlin (1930).
A. N. Kolmogorov, “Zur Deutung der Intuitionistischen,” Logik. Math. Z.,35 (1932).
S. C. Kleene, On the interpretation of intuitionistic number theory,” J. Symb. Logic,10 (1945).
K. Schütte, Beweistheorie, Springer-Verlag (1965).
K. Godel, “Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes,” Dialectica,12, Nos. 3-4 (1958).
G. Kreisel, Mathematical Logic, Wiley (1965).
G. Kreisel, “Foundations of intuitionistic logic,” in: Logic, Methodology and Philosophy of Science, Stanford (1962).
D. Scott, “Constructive validity,” Lect. Notes Math.,125 (1970).
G. E. Mints, “On E-theorems,” Zap. Nauchn. Sem. LOMI Akad. Nauk SSSR,40 (1974).
R. L. Constable, “Constructive mathematics and automatic program writers,” IFIP Congr., 1971, N.-H. Publ. Co. (1972).
G. Kreisel, Some Uses of Proof Theory for Finding Computer Programs. Technical Report, Stanford Oct. (1977).
Z. Manna and R. W. Waldinger, “Towards automatic program synthesis,” Lect. Notes Math.,188 (1971).
A. A. Lyapunov, “On logic program schemes,” in: Problems of Cybernetics [in Russian], No. 1, Nauka, Moscow (1958).
Yu. I. Yanov, “On logic algorithm schemes,” in: Problems of Cybernetics [in Russian], No. 1, Nauka, Moscow (1958).
E. W. Dijkstra, “Guarded commands, non-determinacy and formal derivation of programs,” Commun. ACM,18, No. 8 (1975).
H. D. Mills, “A new math in computer programming,” Complon Fall (1975).
L. A. Zadeh, “Fuzzy sets,” Inf. Control,8 (1965).
N. N. Nepeivoda, “Proofs and programs,” Programmirovanie, No. 1, Moscow (1979).
A Revised Report on Algorithmic Language ALGOL-68 [Russian translation], Mir, Moscow (1978).
K. Schutte, “Vollstandige Systeme Modaler und Intuitionistischer Logik,” Ergeb. Math. Ihre Grenz.,42 (1968).
Z. Manna and P. W. Waldinger, “Towards automatic program synthesis,” Lect. Notes Math.,188 (1971).
R. Lyndon, Notes on Logic [Russian translation], Mir, Moscow (1968).
S. C. Kleene, “Formalized recursive functionals and formalized realizability,” Mem. Am. Math. Soc., No. 89 (1969).
A. A. Markov, Theory of Algorithms [in Russian], Nauka, Moscow (1954).
N. N. Nepeivoda, “Relation between the rules of natural deduction and operators of algorithmic languages of high level,” Dokl. Akad. Nauk SSSR,239, No. 4 (1978).
N. N. Nepeivoda, “A system of rules of deduction of intuitionistic logic oriented toward program generation,” Proceedings of All-Union Sympos. on Applications of Logic to Problems of Artificial Intelligence and Informatics [in Russian], Tbilisi (1978).
J. A. Robinson, “Automatic deduction with hyper-resolution,” Int. J. Comput. Math.,1 (1965).
V. V. Smirnov, Formal Deduction and Logic Calculi [in Russian], Nauka, Moscow (1972).
A. D. Yashin, “Intuitionistic logic with the concept ‘sometime will be,’” All-Union Conference on Mathematical Logic [in Russian], Kishinev, 163 (1976).
Ya. S. Kogan, “A method of effective execution of proofs in a system ‘logic programming language,’” All-Union Symposium on Artificial Intelligence and Automation of Investigations in Mathematics [in Russian], Kiev (1978).
V. M. Glushkov, “Certain problems of the theory of automata and artificial intelligence,” Kibernetika, No. 2 (1970).
N. A. Krupko, “On an automatic system of logic deduction,” Preprint VINITI, No. 1207-77, Moscow (1977).
Additional information
Translated from Kibernetika, No. 2, pp. 43–48, March–April, 1979.
Rights and permissions
About this article
Cite this article
Nepeivoda, N.N. Application of proof theory to the problem of construction of correct programs. Cybern Syst Anal 15, 202–209 (1979). https://doi.org/10.1007/BF01069330
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069330