Показать сокращенную информацию
dc.contributor.author | Fokina E. | |
dc.contributor.author | Frolov A. | |
dc.contributor.author | Kalimullin I. | |
dc.date.accessioned | 2018-09-19T22:03:48Z | |
dc.date.available | 2018-09-19T22:03:48Z | |
dc.date.issued | 2016 | |
dc.identifier.issn | 0029-4527 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/144646 | |
dc.description.abstract | © 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M. If the spectrum has a least degree, this degree is called the degree of categoricity of M. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity. | |
dc.relation.ispartofseries | Notre Dame Journal of Formal Logic | |
dc.subject | Categoricity spectrum | |
dc.subject | Computable structure | |
dc.subject | Computably categorical | |
dc.subject | Degree of categoricity | |
dc.subject | Rigid structure | |
dc.title | Categoricity Spectra for Rigid Structures | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 1 | |
dc.relation.ispartofseries-volume | 57 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 45 | |
dc.source.id | SCOPUS00294527-2016-57-1-SID84954305122 |