| RUS ENG |
| Full version |
|
|
|
| JOURNALS // Algebra i logika // Archive |
|
1973, Volume 12, Number 2
|
|
Constructive models of complete decidable theories S. S. Goncharov, A. T. Nurtazin |
125 | |
|
|
A. N. Degtev |
143 | |
|
|
An example of a solvable but not nilpotent G. V. Dorofeev |
162 | |
|
|
The upper semilattice Yu. L. Ershov, I. A. Lavrov |
167 | |
|
|
btt-reducibility. I G. N. Kobzev |
190 | |
|
|
Undecidability of fields of rational functions over fields of
characteristic Yu. G. Penzin |
205 | |
|
|
Every recursively enumerable extension of a theory of linear order
has a constructive model M. G. Peretyat'kin |
211 | |
|
|
Certain questions on generalized computability L. N. Pobedin |
220 | |
|
|
Certain algorithmic questions for metabelian groups E. I. Timoshenko |
232 | |