On computable self-embeddings of computable linear orderings

DOI10.2178/jsl/1254748695zbMath1201.03029OpenAlexW2153991166MaRDI QIDQ3655260

Steffen Lempp, Bart Kastermans, Rodney G. Downey

Publication date: 7 January 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.525.39

zbMATH Keywords

self-embeddingcomputable linear orderingeta-like

Mathematics Subject Classification ID

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

Related Items

On limitwise monotonicity and maximal block functions ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Some Questions in Computable Mathematics ⋮ Computable linear orders and limitwise monotonic functions ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees of orderings not isomorphic to recursive linear orderings
• Every recursive Boolean algebra is isomorphic to one with incomplete atoms
• On self-embeddings of computable linear orderings
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Concerning similarity transformations of linearly ordered sets