Automatic structures and the theory of lists
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 12 (2015), pp. 714-722
Voir la notice de l'article provenant de la source Math-Net.Ru
Goncharov constructed the axiomatic theory of linear lists over the elements of a given data type. We study algorithmic complexity for models of this theory. We prove that the enriched list structure over a finite set of atoms is automatically presentable, and the enriched list structure over an infinite set of atoms has no automatic presentations.
Keywords:
automatic structure, linear list, theory of lists, decidable model, list superstructure.
@article{SEMR_2015_12_a22,
author = {N. A. Bazhenov},
title = {Automatic structures and the theory of lists},
journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
pages = {714--722},
publisher = {mathdoc},
volume = {12},
year = {2015},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SEMR_2015_12_a22/}
}
N. A. Bazhenov. Automatic structures and the theory of lists. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 12 (2015), pp. 714-722. http://geodesic.mathdoc.fr/item/SEMR_2015_12_a22/