Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T05:42:04.176Z Has data issue: false hasContentIssue false

DECIDABLE MODELS OF ω-STABLETHEORIES

Published online by Cambridge University Press:  17 April 2014

URI ANDREWS*
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF WISCONSIN, MADISON 480 LINCOLN DR., MADISON, WI 53706-1388, USA E-mail: andrews@math.wisc.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We characterize the ω-stable theories all of whosecountable models admit decidable presentations. In particular, we show that fora countable ω-stable T, everycountable model of T admits a decidable presentation if andonly if all n-types in T are recursive andT has only countably many countable models. We furthercharacterize the decidable models of ω-stabletheories with countably many countable models as those which realize onlyrecursive types.

Information

Type
Articles
Copyright
Copyright © Association for Symbolic Logic 2014