Неразрешимость элементарных теорий полурешеток Роджерса аналитической иерархии

We prove that the elementary theory of any nontrivial Rogers semilattice for analytical sets of bounded complexity is hereditarily undecidable. We also prove some results on the existence of minimal numberings in such lattices.