Corrigendum: "On the complexity of the successivity relation in computable linear orderings"

DOI10.1142/S0219061317920027zbMath1375.03035OpenAlexW2734597511MaRDI QIDQ4596667

Steffen Lempp, Rodney G. Downey, Guohua Wu

Publication date: 4 December 2017

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219061317920027

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Computable linear orders and limitwise monotonic functions

Cites Work

• Presentations of the successor relation of computable linear ordering
• Degree spectra of the successor relation of computable linear orderings
• ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS

This page was built for publication: Corrigendum: "On the complexity of the successivity relation in computable linear orderings"