Computable structures of rank omega (ck)(1)

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

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2014-03-07

Downloads
9 (#1,259,126)

6 months
5 (#648,018)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John U. Millar
University of Edinburgh

References found in this work

No references found.

Add more references