| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4661997 | Annals of Pure and Applied Logic | 2011 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
