New spectra of strongly minimal theories in finite languages

  title={New spectra of strongly minimal theories in finite languages},
  author={Uri Andrews},
  journal={Ann. Pure Appl. Logic},
We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation. 

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-6 of 6 references

Shore , Computable models of theories with few models

  • Bakhadyr Khoussainov, Andre Nies, A. Richard
  • Notre Dame J . Formal Logic
  • 1997

On constructive models of undecidable theories, Sib

  • Kanat Kudaibergenov
  • Math. Journ
  • 1980
2 Excerpts

Similar Papers

Loading similar papers…