Automorphisms ofη-like computable linear orderings and Kierstead's conjecture
Charles M. Harris, Kyung Il Lee, S. Barry Cooper · Mathematical logic quarterly · 2016
We develop an approach to the longstanding conjecture of Kierstead concerning the character of strongly nontrivial automorphisms of computable linear orderings. Our main result is that for any η-like computable linear ordering , such that has no interval of order type η, and such that the order type of is determined by a -limitwise monotonic maximal block function, there exists computable such that has no nontrivial automorphism.