Presentations of the successor relation of computable linear ordering
From MaRDI portal
Publication:619461
DOI10.3103/S1066369X10070078zbMath1218.03029MaRDI QIDQ619461
Publication date: 25 January 2011
Published in: Russian Mathematics (Search for Journal in Brave)
03D45: Theory of numerations, effectively presented structures
Related Items
Corrigendum: "On the complexity of the successivity relation in computable linear orderings", Punctual 1-linear orders, Computable linear orders and the Ershov hierarchy, Ranges of \(\eta \)-functions of \(\eta \)-like linear orderings, Computable linear orders and the ershov hierarchy, Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
Cites Work