Automorphisms ofη-like computable linear orderings and Kierstead's conjecture

DOI10.1002/malq.201400109zbMath1377.03034WikidataQ59890761 ScholiaQ59890761MaRDI QIDQ2958211

Kyung Il Lee, S. Barry Cooper, Charles M. Harris

Publication date: 1 February 2017

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/86945/7/automorphisms2015.pdf

zbMATH Keywords

automorphism; computable linear order; Kirstead's conjecture

Mathematics Subject Classification ID

06A05: Total orders

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

Related Items

On Kierstead’s conjecture, The Kierstead's conjecture and limitwise monotonic functions, Computable linear orders and limitwise monotonic functions

Cites Work

• Unnamed Item
• Unnamed Item
• Computable shuffle sums of ordinals
• Classical recursion theory. The theory of functions and sets of natural numbers
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
• Low linear orderings
• On limitwise monotonicity and maximal block functions
• Increasing η -representable degrees
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• η-representation of sets and degrees
• Degrees in Which the Recursive Sets are Uniformly Recursive