Algebra and Logic

Computably enumerable sets and related issues
Generalizations of Hensel’s lemma and the nearest root method
Hereditarily pure associative algebras over a Dedekind ring whose maximal ideals have finite indices
Local and nonvanishing superatomic Boolean algebras with a distinguished dense subalgebra
Positive undecidable numberings in the Ershov hierarchy
Sessions of the seminar “Algebra i Logika”
The computable embedding problem
Universal theories for rigid soluble groups