Linear orderings of low degree
From MaRDI portal
Publication:610306
DOI10.1007/s11202-010-0091-7zbMath1209.03032OpenAlexW2038761581MaRDI QIDQ610306
Publication date: 8 December 2010
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11202-010-0091-7
Related Items (13)
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders ⋮ Initial segments of computable linear orders with computable natural relations ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Punctual 1-linear orders ⋮ A class of low linear orders having computable presentations ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ On a computable presentation of low linear orderings ⋮ Computable linear orders and the Ershov hierarchy ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ Computable linear orders and the ershov hierarchy
Cites Work
This page was built for publication: Linear orderings of low degree