On the Programs with finite development
The study of programs with finite development, i.e. programs that have every oriented path issuing from the initial node of finite length is of certain interest. Many naturally arising problems, e.g. problems of discrete optimization of limited dimension can be solved with the help of such programs /3/. Furthermore the limitation of the number of accomplished operations turns unspecified program into an object similar to the programs with finite development in their properties.
The present paper deals with the interrelation of two properties of programs: to be the program with finite development and to realize an everywhere definite function. The notions without definitions below refer to the 1-st order logic. Their definitions can be found in /1/.
Unable to display preview. Download preview PDF.
- 1.Ershov, Iu.L.; Paliutin, E.A. Mathematical logic. (Russian) "Nauka", Moscow, 1979.Google Scholar
- 2.Chang, C.C.; Keisler, H.J. Model theory. North-Holland, Amsterdam, 1973.Google Scholar
- 3.Moshkov, M.Iu. On the conditional tests. (Russian) Dokl. Akad. Nauk SSSR 265 (1982), no. 3, 550–552.Google Scholar