On initial segments of computable linear orders
From MaRDI portal
Publication:1267602
DOI10.1023/A:1006031314563zbMath0915.03040MaRDI QIDQ1267602
Richard J. Coles, Bakhadyr Khoussainov, Rodney G. Downey
Publication date: 27 June 1999
Published in: Order (Search for Journal in Brave)
Related Items (14)
A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ Initial segments of computable linear orders with computable natural relations ⋮ On limitwise monotonicity and maximal block functions ⋮ Iterated effective embeddings of abelian p-groups ⋮ A class of low linear orders having computable presentations ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Initial segments of computable linear orders with additional computable predicates ⋮ Prime models of theories of computable linear orderings ⋮ Computable shuffle sums of ordinals ⋮ Limitwise monotonic functions, sets, and degrees on computable domains ⋮ Computable linear orders and limitwise monotonic functions ⋮ Computable presentability of countable linear orders ⋮ Limitwise monotonic sequences and degree spectra of structures ⋮ \(\Sigma_{2}^{0}\)-initial segments of computable linear orders
This page was built for publication: On initial segments of computable linear orders
