# Twelve papers on logic and differential equations

### About this Title

Publication: American Mathematical Society Translations: Series 2

Publication Year
1963: Volume 29

ISBNs: 978-0-8218-1729-2 (print); 978-1-4704-3240-9 (online)

DOI: http://dx.doi.org/10.1090/trans2/029

### Table of Contents

**Front/Back Matter**

**Articles**

- Andrzej Mostowski – On undecidable sentences in formalized mathematical systems
- P. S. Novikov – On the consistency of some propositions of the descriptive theory of sets
- N. M. Nagornyĭ – Some generalizations of the concept of a normal algorithm
- N. M. Nagornyĭ – On a minimal alphabet of algorithms over a given alphabet
- A. A. Markov – On constructive functions
- A. A. Mučnik – Solution of Post’s reduction problem and some other problems of the theory of algorithms. I
- A. N. Kolmogorov and V. A. Uspenskiĭ – On the definition of an algorithm
- F. V. Širokov – Solution of a problem of Halmos (concept of a recurrent numerical sequence)
- V. I. Lebedev – The equations and convergence of a differential-difference method (the method of lines)
- Jaroslav Kurzweĭl and Ivo Vrkoč – On the converses of Ljapunov’s theorem on stability and Persidskiĭ’s theorem on uniform stability
- B. M. Peretjagin – On the number of limit cycles of the equation $\frac {dy}{dx} =\frac {cx+dy+P(x,y)} {ax+by+Q(x,y)}$, where $P(x, y)$ and $Q(x, y)$ are homogeneous polynomials of degree $n$
- I. M. Gel′fand – Some problems in the theory of quasilinear equations