A modelU is decidable if Th(U,a) a∈A is recursive. Various results about decidable models are discussed. A necessary and sufficient condition for there to be a decidable saturated model is given.
KeywordsDecidable Model Prime Model Complete Theory Saturated Model Countable Model
Unable to display preview. Download preview PDF.
- 1.J. Barwise and J. Schipf,Recursively saturated and resplendent models, to appear in J. Symbolic Logic.Google Scholar
- 3.T. Millar,The Theory of Recursively Presented Modules, Dissertation, Cornell University, 1976.Google Scholar
- 5.B. L. Vaught,Denumerable models of complete theories, Proc. Symp. on Foundations of Math. Infinitistic Methods, Warsaw, Pergamon Press, 1961, pp. 303–321.Google Scholar