Initial segments of recursive linear orders

DOI10.1023/A:1006043601359MaRDI QIDQ1267600zbMATH OpenOpenAlexFDO

Authors S. Barry Cooper, Steffen Lempp, Klaus Ambos-Spies

Publication date 25 March 1999

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1006043601359

zbMATH Keywords

initial segmentrecursive linear order

Mathematics Subject Classification ID

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

Recommendations

• On initial segments of computable linear orders
• Initial segments of computable linear orders with additional computable predicates
• Initial segments of computable linear orders with computable natural relations
• scientific article; zbMATH DE number 749928
• Recursive Linear Orders with Incomplete Successivities

Cited in

(10)

• On initial segments of computable linear orders
• Weak and strong orders of linear recurring sequences
• On computably enumerable structures
• \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
• Graphs realised by r.e. equivalence relations
• On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
• Recursive Linear Orders with Incomplete Successivities
• Initial segments of computable linear orders with additional computable predicates
• scientific article; zbMATH DE number 749928 (Why is no real title available?)
• Reducibilities among equivalence relations induced by recursively enumerable structures

This page was built for publication: Initial segments of recursive linear orders

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