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

DOI10.1142/S0219061317920027MaRDI QIDQ4596667zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Degree spectra of the successor relation of computable linear orderings
• On the complexity of the successivity relation in computable linear orderings
• Presentations of the successor relation of computable linear ordering

Cited in

(3)

• Computable linear orders and limitwise monotonic functions
• Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
• The complexity of the successor and the block relations on computable linear orders

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596667)