- Michael C. Laskowski, “The elementary diagram of a trivial, weakly minimal structure is near model complete”, Arch. Math. Logic, 48, № 1, 2009, 15
- Bakhadyr Khoussainov, Antonio Montalbán, “A computable ℵ0-categorical structure whose theory computes true arithmetic”, J. symb. log., 75, № 2, 2010, 728
- S. S. Goncharov, “On two problems of turing complexity for strongly minimal theories”, Dokl. Math., 77, № 3, 2008, 438
- Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124