Δ 2 0 -copies of linear orderings

DOI10.1007/s10469-006-0017-4zbMath1115.03047OpenAlexW2055005877MaRDI QIDQ5294715

No author found.

Publication date: 26 July 2007

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-006-0017-4

zbMATH Keywords

countable linear ordering\(\Delta _2^0\)-degree\(\Delta _2^0\)-spectrum

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Linear orderings of low degree ⋮ Punctual copies of algebraic structures ⋮ Punctual 1-linear orders ⋮ A class of low linear orders having computable presentations ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ Computability on linear orderings enriched with predicates ⋮ A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation ⋮ COMPUTABLE LINEAR ORDERS AND PRODUCTS ⋮ On a computable presentation of low linear orderings ⋮ Computable linear orders and the Ershov hierarchy ⋮ Ranges of \(\eta \)-functions of \(\eta \)-like linear orderings ⋮ Scattered linear orderings with no computable presentation ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ Coding and definability in computable structures ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ Effective categoricity of computable linear orderings ⋮ Computable linear orders and the ershov hierarchy

This page was built for publication: Δ 2 0 -copies of linear orderings