Geodesic

Volume 8 (1969) no. 1

Sommaire

The complexity of the word problem for finitely presented groups
p. 5-43
The correlation between the class of all context-free languages
p. 44-64
Computable enumerations. II
p. 65-71
Representation of finitely generated metabelian groups by
p. 72-75
Nonregular first order predicate calculus
p. 76-92
The complexity of reduction algorithms in Novikov-Boone
p. 93-128
The lower central series of a free product of groups
p. 129-137