New spectra of strongly minimal theories in finite languages

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.

• Type: Journal
• Year: 2011
• Where: APAL
• Authors: Uri Andrews
• Keywords: APAL 2011, Recursive Presentation, Software Engineering, Strongly Minimal Theory, finite Language