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

1969, Volume 8, Number 1  

The complexity of the word problem for finitely presented groups
M. K. Valiev 		5–43
The correlation between the class of all context-free languages and the class of deterministic context-free languages
A. Ya. Dikovsky 		44–64
Computable enumerations. II
Yu. L. Ershov, I. A. Lavrov 		65–71
Representation of finitely generated metabelian groups by matrices.
V. N. Remeslennikov 		72–75
Nonregular first order predicate calculus
A. Tauts 		76–92
The complexity of reduction algorithms in Novikov-Boone constructions.
B. A. Trakhtenbrot 		93–128
The lower central series of a free product of groups
A. L. Shmel'kin 		129–137
Алгебра и логика Algebra and Logic
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026