|
This article is cited in 23 scientific papers (total in 23 papers)
Uniformity in Computable Structure Theory
R. Downeya, D. Hirschfeldtb, B. Khoussainovc a Victoria University of Wellington, School of Mathematics, Statistics and Computer Science
b University of Chicago
c University of Auckland
Abstract:
We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.
Keywords:
computably categorical structure, intrinsically computable relation on a computable structure, relative computable structure, general computable structure.
Received: 10.11.2000
Citation:
R. Downey, D. Hirschfeldt, B. Khoussainov, “Uniformity in Computable Structure Theory”, Algebra Logika, 42:5 (2003), 566–593; Algebra and Logic, 42:5 (2003), 318–332
Linking options:
https://www.mathnet.ru/eng/al44 https://www.mathnet.ru/eng/al/v42/i5/p566
|
Statistics & downloads: |
Abstract page: | 328 | Full-text PDF : | 125 | References: | 64 | First page: | 1 |
|