Automorphisms of -like computable linear orderings and Kierstead's conjecture
DOI10.1002/MALQ.201400109zbMATH Open1377.03034OpenAlexW2133386786WikidataQ59890761 ScholiaQ59890761MaRDI QIDQ2958211FDOQ2958211
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
Recommendations
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Total orders (06A05)
Cites Work
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Classical recursion theory. The theory of functions and sets of natural numbers
- Title not available (Why is that?)
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Title not available (Why is that?)
- On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
- Low linear orderings
- Increasing η -representable degrees
- Computable shuffle sums of ordinals
- η-representation of sets and degrees
- On limitwise monotonicity and maximal block functions
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
Cited In (7)
- Autostability of automatic representations of well-orders and lower-rank linear orders
- On computable self-embeddings of computable linear orderings
- The Kierstead's conjecture and limitwise monotonic functions
- On Π1-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)
