Presentations of the successor relation of computable linear ordering

DOI10.3103/S1066369X10070078zbMath1218.03029MaRDI QIDQ619461

A. N. Frolov

Publication date: 25 January 2011

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

degree spectrumcomputable linear orderingsuccessor relation

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (6)

Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Punctual 1-linear orders ⋮ Corrigendum: "On the complexity of the successivity relation in computable linear orderings" ⋮ Computable linear orders and the Ershov hierarchy ⋮ Ranges of \(\eta \)-functions of \(\eta \)-like linear orderings ⋮ Computable linear orders and the ershov hierarchy

Cites Work

• Degree spectra of the successor relation of computable linear orderings
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Recursive Linear Orders with Incomplete Successivities

This page was built for publication: Presentations of the successor relation of computable linear ordering