Abstract
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of strongly nontrivial automorphisms of computable linear orderings. Our main result is that for any η-like computable linear ordering B, such that B has no interval of order type η, and such that the order type of B is determined by a 0′-limitwise monotonic maximal block function, there exists computable L isomorphic to B such that L has no nontrivial Π^0_1 automorphism.
Original language | English |
---|---|
Pages (from-to) | 481-506 |
Number of pages | 26 |
Journal | Mathematical Logic Quarterly |
Volume | 62 |
Issue number | 6 |
Early online date | 29 Dec 2016 |
DOIs | |
Publication status | Published - Dec 2016 |
Bibliographical note
Date of Acceptance: 25/04/2015Keywords
- Computable,
- linear ordering,
- automorphism,
- rigidity