Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Autostability of Automatic Linear Orders

Edit abstract data

Speaker: Alexandra Revenko
Slot: Wed, 16:50-17:10, Amphitheater B (col. 2)

Abstract

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 Valid HTML 4.01! Valid CSS!