This article is cited in 1 paper

Complexity of categorical theories with computable models

E. Fokina


Abstract: In the paper 2 theorems are proved:
There is an uncountably categorical but not countably categorical theory of an arbitrary given arithmetical complexity with a computable model. All countable models of this theory are computable.
There is a countably categorical theory of an arbitrary given arithmetical complexity with a computable model.

UDC: 517.1+519.5