Degrees of categoricity of computable structures

dc.contributor.author	Fokina E.
dc.contributor.author	Kalimullin I.
dc.contributor.author	Miller R.
dc.date.accessioned	2018-09-18T20:10:39Z
dc.date.available	2018-09-18T20:10:39Z
dc.date.issued	2009
dc.identifier.issn	0933-5846
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/137289
dc.description.abstract	Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d. c. e. in and above 0(n) can be so realized, as can the degree 0(ω). © 2009 Springer-Verlag.
dc.relation.ispartofseries	Archive for Mathematical Logic
dc.subject	Categoricity spectrum
dc.subject	Computability
dc.subject	Computable model theory
dc.subject	Computable structure
dc.subject	Degree of categoricity
dc.title	Degrees of categoricity of computable structures
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	49
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	51
dc.source.id	SCOPUS09335846-2009-49-1-SID72249111331

Files in this item

Size: 43.97Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.