A computably stable structure with no Scott family of finitary formulas

Abstract

One of the goals of computability theory is to find syntactic equivalences for computational properties. The Limit Lemma is a classic example of this type of equivalence: X ⊆ ω is computable from 0′ if and only if it is arithmetically definable by a ∆2 formula. A more relevant example for this paper was proved independently by Ash, Knight, Manasse and… (More)
DOI: 10.1007/s00153-005-0326-7

Topics

Cite this paper

@article{Cholak2006ACS, title={A computably stable structure with no Scott family of finitary formulas}, author={Peter Cholak and Richard A. Shore and Reed Solomon}, journal={Arch. Math. Log.}, year={2006}, volume={45}, pages={519-538} }