Automorphisms of η‐like computable linear orderings and Kierstead's conjecture |
| |
Authors: | Charles M Harris Kyung Il Lee S Barry Cooper |
| |
Institution: | 1. Department of Mathematics, University of Leeds, Leeds, United Kingdom;2. Department of Mathematics, Yonsei University, Seoul, South Korea |
| |
Abstract: | 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. |
| |
Keywords: | |
|
|