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

DOI10.1002/MALQ.201400109MaRDI QIDQ2958211zbMATH OpenOpenAlexWikidataFDO

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

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

automorphismcomputable linear orderKirstead's conjecture

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Total orders (06A05)

Recommendations

• On Kierstead’s conjecture
• The Kierstead's conjecture and limitwise monotonic functions
• On computable self-embeddings of computable linear orderings
• On Π₁-automorphisms of recursive linear orders
• On self-embeddings of computable linear orderings

Cites work

• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• scientific article; zbMATH DE number 3342831 (Why is no real title available?)
• η-representation of sets and degrees
• Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
• Classical recursion theory. The theory of functions and sets of natural numbers
• Computable shuffle sums of ordinals
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Increasing η -representable degrees
• Low linear orderings
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• On limitwise monotonicity and maximal block functions
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings

Cited in

(7)

• Autostability of automatic representations of well-orders and lower-rank linear orders
• The Kierstead's conjecture and limitwise monotonic functions
• On computable self-embeddings of computable linear orderings
• On Π₁-automorphisms of recursive linear orders
• Linear orders with distinguished function symbol
• Computable linear orders and limitwise monotonic functions
• On Kierstead’s conjecture

This page was built for publication: Automorphisms of \(\eta\)-like computable linear orderings and Kierstead's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958211)