Computability in Europe 2006
Logical Approaches to Computational Barriers

Regular Talk:
Autostability of Automatic Linear Orders

Speaker: Alexandra Revenko
Slot: Array, 16:50-17:10, col. 2


Every two automatic presentations of a well order are computably isomorphic.
Such result is true for scattered  linear order with FC-rank less then 4.

websites: Arnold Beckmann 2008-05-19