On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
From MaRDI portal
Publication:3800020
DOI10.1002/malq.19890350307zbMath0654.03032OpenAlexW2166258826MaRDI 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
Related Items
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders, On limitwise monotonicity and maximal block functions, Linear orderings of low degree, A class of low linear orders having computable presentations, Automorphisms ofη-like computable linear orderings and Kierstead's conjecture, THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES, The Kierstead's conjecture and limitwise monotonic functions, On a computable presentation of low linear orderings, Recursive Linear Orders with Incomplete Successivities, Scattered linear orderings with no computable presentation, Computable linear orders and limitwise monotonic functions, Computable presentability of countable linear orders, On Kierstead’s conjecture, On computable self-embeddings of computable linear orderings