14 citations to 10.1090/S0002-9939-03-06951-X (Crossref Cited-By Service)
  1. Michael C. Laskowski, “The elementary diagram of a trivial, weakly minimal structure is near model complete”, Arch. Math. Logic, 48, no. 1, 2009, 15  crossref
  2. Bakhadyr Khoussainov, Antonio Montalbán, “A computable ℵ0-categorical structure whose theory computes true arithmetic”, J. symb. log., 75, no. 2, 2010, 728  crossref
  3. S. S. Goncharov, “On two problems of turing complexity for strongly minimal theories”, Dokl. Math., 77, no. 3, 2008, 438  crossref
  4. Ekaterina B. Fokina, Valentina Harizanov, Alexander Melnikov, Turing's Legacy, 2014, 124  crossref
Previous
1
2