Automorphisms of η-Like Computable Linear Orderings and Kierstead’s Conjecture

Charles Harris, Kyung Il Lee, S. Barry Cooper

Research output: Contribution to journalArticle (Academic Journal)peer-review

265 Downloads (Pure)

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 languageEnglish
Pages (from-to)481-506
Number of pages26
JournalMathematical Logic Quarterly
Volume62
Issue number6
Early online date29 Dec 2016
DOIs
Publication statusPublished - Dec 2016

Bibliographical note

Date of Acceptance: 25/04/2015

Keywords

  • Computable,
  • linear ordering,
  • automorphism,
  • rigidity

Fingerprint Dive into the research topics of 'Automorphisms of η-Like Computable Linear Orderings and Kierstead’s Conjecture'. Together they form a unique fingerprint.

Cite this