Uniformity in Computable Structure Theory
Algebra i logika, Tome 42 (2003) no. 5, pp. 566-593
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{AL_2003_42_5_a2,
author = {R. Downey and D. Hirschfeldt and B. Khoussainov},
title = {Uniformity in {Computable} {Structure} {Theory}},
journal = {Algebra i logika},
pages = {566--593},
publisher = {mathdoc},
volume = {42},
number = {5},
year = {2003},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2003_42_5_a2/}
}
R. Downey; D. Hirschfeldt; B. Khoussainov. Uniformity in Computable Structure Theory. Algebra i logika, Tome 42 (2003) no. 5, pp. 566-593. http://geodesic.mathdoc.fr/item/AL_2003_42_5_a2/