Low linear orderings
From MaRDI portal
Publication:2907053
DOI10.1093/logcom/exq040zbMath1260.03083OpenAlexW2169861056MaRDI QIDQ2907053
No author found.
Publication date: 5 September 2012
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1fa9d47279cc330188a7fe4d2b54b4fcee5876af
Related Items (16)
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders ⋮ On limitwise monotonicity and maximal block functions ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Rice sequences of relations ⋮ A class of low linear orders having computable presentations ⋮ Automorphisms ofη-like computable linear orderings and Kierstead's conjecture ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation ⋮ On a computable presentation of low linear orderings ⋮ Computable linear orders and the Ershov hierarchy ⋮ Scattered linear orderings with no computable presentation ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ Computable linear orders and the ershov hierarchy
This page was built for publication: Low linear orderings
