Autostability of Automatic Presentations of Well Orders and Low Rank Linear Orders
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 4, pp. 78-88
Voir la notice de l'article provenant de la source Math-Net.Ru
The proposition that if $L$ is linear order then its $FC$-rank is finite was proved in Rubin's thesis (S. Rubin, Automatic Structures, A thesis submitted in partial fulfilment of the requirements for the Degree of Doctor of Philosophy, The University of Auckland, 2004), Automatic Structures. We showed that every two automatic presentation of ordinal or linear order with $FC$-rank less then 2 are computable isomorphic. The example of automatic linear order with complicated structure was provided. Moreover it was showed that every automatic linear order is definable in appropriate automatic linear order with $FC$-rank 1 by the first order fomula with additional quantifier $\exists^\infty$.
@article{VNGU_2008_8_4_a7,
author = {A. A. Revenko},
title = {Autostability of {Automatic} {Presentations} of {Well} {Orders} and {Low} {Rank} {Linear} {Orders}},
journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
pages = {78--88},
publisher = {mathdoc},
volume = {8},
number = {4},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VNGU_2008_8_4_a7/}
}
TY - JOUR AU - A. A. Revenko TI - Autostability of Automatic Presentations of Well Orders and Low Rank Linear Orders JO - Sibirskij žurnal čistoj i prikladnoj matematiki PY - 2008 SP - 78 EP - 88 VL - 8 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VNGU_2008_8_4_a7/ LA - ru ID - VNGU_2008_8_4_a7 ER -
A. A. Revenko. Autostability of Automatic Presentations of Well Orders and Low Rank Linear Orders. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 8 (2008) no. 4, pp. 78-88. http://geodesic.mathdoc.fr/item/VNGU_2008_8_4_a7/