Computable structures of rank omega (ck)(1)

Journal of Mathematical Logic 10 (1):31-43 (2010)

John U. Millar
University of Edinburgh
For countable structure, "Scott rank" provides a measure of internal, model-theoretic complexity. For a computable structure, the Scott rank is at most [Formula: see text]. There are familiar examples of computable structures of various computable ranks, and there is an old example of rank [Formula: see text]. In the present paper, we show that there is a computable structure of Scott rank [Formula: see text]. We give two different constructions. The first starts with an arithmetical example due to Makkai, and codes it into a computable structure. The second re-works Makkai's construction, incorporating an idea of Sacks.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1142/s0219061310000912
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 42,236
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles


Added to PP index

Total views

Recent downloads (6 months)

How can I increase my downloads?


Sorry, there are not enough data points to plot this chart.

My notes

Sign in to use this feature