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)

An autostable 1-decidable model without a computable Scott family of ∃ formulas

O. V. Kudinov

Algebra and Logic vol

1996

1 Excerpt

The quantity of non-autoequivalent constructivizations

S. S. Goncharov

Algebra and Logic

1977

1 Excerpt

Enumerations of families of general recursive functions, Algebra and Logic

V. L. Selivanov

1976

2 Excerpts

Autostability and computable families of constructivizations

S. S. Goncharov

Algebra and Logic

1975

1 Excerpt

Similar Papers

Loading similar papers…

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}
}