Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

1973, Volume 12, Number 2  

Constructive models of complete decidable theories
S. S. Goncharov, A. T. Nurtazin 		125–142
$tt$- and $m$-degrees
A. N. Degtev 		143–161
An example of a solvable but not nilpotent $(-1,1)$-ring
G. V. Dorofeev 		162–166
The upper semilattice $L(\gamma )$
Yu. L. Ershov, I. A. Lavrov 		167–189
btt-reducibility. I
G. N. Kobzev 		190–204
Undecidability of fields of rational functions over fields of characteristic $2$
Yu. G. Penzin 		205–210
Every recursively enumerable extension of a theory of linear order has a constructive model
M. G. Peretyat'kin 		211–219
Certain questions on generalized computability
L. N. Pobedin 		220–231
Certain algorithmic questions for metabelian groups
E. I. Timoshenko 		232–240
Алгебра и логика Algebra and Logic
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025