On initial segments of computable linear orders

DOI10.1023/A:1006031314563MaRDI QIDQ1267602zbMATH OpenFDO

Authors Richard Coles, Bakhadyr Khoussainov, Rodney G. Downey

Publication date 27 June 1999

Published in Order (Search for Journal in Brave)

zbMATH Keywords

computable linear orderinitial segmentsarithmetic degrees

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Initial segments of computable linear orders with additional computable predicates
• Initial segments of computable linear orders with computable natural relations
• Initial segments of recursive linear orders
• COMPUTABLE LINEAR ORDERS AND PRODUCTS

Cited in

(17)

• Limitwise monotonic functions, sets, and degrees on computable domains
• Iterated effective embeddings of abelian \(p\)-groups
• A characterization of the strongly \(\eta\)-representable many-one degrees
• Computable presentability of countable linear orders
• Rogers semilattices of limitwise monotonic numberings
• Prime models of theories of computable linear orderings
• Initial segments of computable linear orders with computable natural relations
• \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
• Linear orders with distinguished function symbol
• Initial segments of computable linear orders with additional computable predicates
• Computable linear orders and limitwise monotonic functions
• A class of low linear orders having computable presentations
• Computable choice functions for computable linear orderings
• Order-computable sets
• On limitwise monotonicity and maximal block functions
• Limitwise monotonic sequences and degree spectra of structures
• Computable shuffle sums of ordinals

This page was built for publication: On initial segments of computable linear orders

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