Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T17:55:57.882Z Has data issue: false hasContentIssue false

Applications of Kolmogorov complexity to computable model theory

Published online by Cambridge University Press:  12 March 2014

Bakhadyr Khoussainov
Affiliation:
Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand, E-mail: bmk@cs.auckland.ac.nz
Pavel Semukhin
Affiliation:
Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand, E-mail: pavel@cs.auckland.ac.nz
Frank Stephan
Affiliation:
National University of Singapore, Mathematical Institute, 2 Science Drive 2, Singapore117543, Republic of Singapore, E-mail:, fstephan@comp.nus.edu.sg

Abstract

In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique computable isomor-phism type? Our answer is affirmative and uses a construction based on Kolmogorov complexity. With a variation of this construction, we also provide an example of an ℵ1-categorical but not ℵ0-categorical saturated -structure with a unique computable isomorphism type. In addition, using the construction we give an example of an ℵ1-categorical but not ℵ0-categorical theory whose only non-computable model is the prime one.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable