Structures in Familiar Classes Which Have Scott Rank \omega₁CK

MaRDI QIDQ6208858zbMATH OpenFDO

Authors Wesley Calvert, S. S. Goncharov, J. F. Knight

Publication date 22 March 2008

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Abstract: There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank

o m e g a_{1}^{C K} + 1

. Makkai produced a structure of Scott rank

o m e g a_{1}^{C K}

, which can be made computable, and simplified so that it is just a tree. In the present paper, we show that there are further computable structures of Scott rank

o m e g a_{1}^{C K}

in the following classes: undirected graphs, fields of any characteristic, and linear orderings. The new examples share with the Harrison ordering, and the tree just mentioned, a strong approximability property.

This page was built for publication: Structures in Familiar Classes Which Have Scott Rank $\omega_1^{CK}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6208858)