|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2005, Volume 5, Issue 2, Pages 77–85
(Mi vngu208)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Citation:
E. Fokina, “Complexity of categorical theories with computable models”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 5:2 (2005), 77–85
Linking options:
https://www.mathnet.ru/eng/vngu208 https://www.mathnet.ru/eng/vngu/v5/i2/p77
|
Statistics & downloads: |
Abstract page: | 136 | Full-text PDF : | 102 | References: | 44 | First page: | 1 |
|