An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated

Bakhadyr Khoussainov, Denis R. Hirschfeldt, Pavel Semukhin. An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated. Notre Dame Journal of Formal Logic, 47(1):63-71, 2006. [doi]

@article{KhoussainovHS06,
  title = {An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated},
  author = {Bakhadyr Khoussainov and Denis R. Hirschfeldt and Pavel Semukhin},
  year = {2006},
  url = {http://projecteuclid.org/euclid.ndjfl/1143468311},
  researchr = {https://researchr.org/publication/KhoussainovHS06},
  cites = {0},
  citedby = {0},
  journal = {Notre Dame Journal of Formal Logic},
  volume = {47},
  number = {1},
  pages = {63-71},
}