On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders

DOI10.1002/malq.19890350307zbMath0654.03032MaRDI QIDQ3800020

Michael Moses, Rodney G. Downey

Publication date: 1989

Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19890350307

zbMATH Keywords

recursive discrete linear order; strongly non-trivial automorphism; strongly non-trivial self-embedding

Mathematics Subject Classification ID

06A05: Total orders

03D45: Theory of numerations, effectively presented structures

Related Items

On Kierstead’s conjecture, A class of low linear orders having computable presentations, Linear orderings of low degree, On a computable presentation of low linear orderings, The Kierstead's conjecture and limitwise monotonic functions, Computable linear orders and limitwise monotonic functions, Computable presentability of countable linear orders, Scattered linear orderings with no computable presentation, Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders, Automorphisms ofη-like computable linear orderings and Kierstead's conjecture, On limitwise monotonicity and maximal block functions, On computable self-embeddings of computable linear orderings, Recursive Linear Orders with Incomplete Successivities