On computable self-embeddings of computable linear orderings

DOI10.2178/JSL/1254748695MaRDI QIDQ3655260zbMATH OpenOpenAlexFDO

Authors Bart Kastermans, Steffen Lempp, Rodney G. Downey

Publication date 7 January 2010

Published in 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

computable linear orderingeta-likeself-embedding

Mathematics Subject Classification ID

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

Recommendations

• On self-embeddings of computable linear orderings
• Computable embeddings for pairs of linear orders
• Self-embeddings of computable trees
• scientific article; zbMATH DE number 1303201
• Automorphisms of -like computable linear orderings and Kierstead's conjecture

Cites work

• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
• Concerning similarity transformations of linearly ordered sets
• Degrees of orderings not isomorphic to recursive linear orderings
• Every recursive Boolean algebra is isomorphic to one with incomplete atoms
• scientific article; zbMATH DE number 994428 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• On self-embeddings of computable linear orderings

Cited in

(15)

• Self-embeddings of computable trees
• A computably enumerable partial ordering without computably enumerable maximal chains and antichains
• Computable linear orders and limitwise monotonic functions
• On self-embeddings of computable linear orderings
• Prime models of theories of computable linear orderings
• Low linear orderings
• Automorphisms of -like computable linear orderings and Kierstead's conjecture
• Some Questions in Computable Mathematics
• On the complexity of the successivity relation in computable linear orderings
• On limitwise monotonicity and maximal block functions
• On the Equimorphism Types of Linear Orderings
• Decidable discrete linear orders
• On maximal block functions of computable \(\eta \)-like linear orderings
• The block relation in computable linear orders
• The complexity of the successor and the block relations on computable linear orders

This page was built for publication: On computable self-embeddings of computable linear orderings

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