1. S.A. Badaev, On incomparable enumerations. Sibirsk. Mat. Zh., 1974, vol. 15, no. 4, pp. 730–738 (Russian); Siberian Math. J. 1974, vol. 15, no. 4, pp. 519–524 (English translation).
2. S.A. Badaev, S.S. Goncharov, Theory of numberings: open problems. In Computability Theory and its Applications. P. Cholak, S. Lempp, M. Lerman and R. Shore eds.—Contemporary Mathematics, American Mathematical Society, 2000, vol. 257, Providence, pp. 23–38.
3. S.A. Badaev, S.S. Goncharov, On Rogers semilattices of families of arithmetical sets. Algebra i Logika, 2001, vol. 40, no. 5, pp. 507–522 (Russian); Algebra and Logic, 2001, vol. 40, no. 5, pp. 283–291 (English translation).
4. S.A. Badaev, S.S. Goncharov, A. Sorbi, Arithmetical numberings: completeness and universality. This volume.
5. S.A. Badaev, S.Yu. Podzorov, Minimal covers in Rogers semilattices of
$$ \sum\nolimits_n^0 {} $$
- computable numberings. Siberian Math. J., to appear.