Automorphisms of [eta]-like computable linear orderings and Kierstead's conjecture

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 B, such that B has no interval of order type η, and such that the order t...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical logic quarterly 2016-12, Vol.62 (6), p.481
Main Authors: Harris, Charles M, Lee, Kyung Il, Cooper, S Barry
Format: Article
Language:eng ; fre ; ger
Subjects:
Automorphisms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 B, such that B has no interval of order type η, and such that the order type of B is determined by a -limitwise monotonic maximal block function, there exists computable L B such that L has no nontrivial Π 1 0 automorphism.
ISSN:0942-5616
1521-3870
DOI:10.1002/malq.201400109