Includes bibliographical references.

On undecidable sentences in formalized mathematical systems /; On the consistency of some propositions of the descriptive theory of sets /; Some generalizations of the concept of a normal algorithm /; On a minimal alphabet of algorithms over a given alphabet /; On constructive functions /; Solution of Post's reduction problem and some other problems of the theory of algorithms. I /; On the definition of an algorithm /; Solution of a problem of Halmos (concept of a recurrent numerical sequence) /; The equations and convergence of a differential-difference method (the method of lines) /; On the converses of Ljapunov's theorem on stability and Persidski�i's theorem on uniform stability /; On the number of limit cycles of the equation frac {dy}{dx} =\frac {cx+dy+P(x,y)} {ax+by+Q(x,y)} where (x, y) and (x, y) are homogeneous polynomials of degree /; Some problems in the theory of quasilinear equations / Andrzej Mostowski; P. S. Novikov; N. M. Nagornyi; N. M. Nagornyi; A. A. Markov; A. A. Mucnik; A. N. Kolmogorov and V. A. Uspenskii; F. V. Sirokov; V. I. Lebedev; Jaroslav Kurzweil and Ivo Vrkoc; B. M. Peretjagin; I. M. Gelfand