Switch to: References

Citations of:

On the complexity of the successivity relation in computable linear orderings

Rod Downey, Steffen Lempp & Guohua Wu

Journal of Mathematical Logic 10 (1):83-99 (2010)

Add citations

You must login to add citations.

Computability and uncountable linear orders II: Degree spectra.Noam Greenberg, Asher M. Kach, Steffen Lempp & Daniel D. Turetsky - 2015 - Journal of Symbolic Logic 80 (1):145-178.details Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark
Corrigendum: "On the complexity of the successivity relation in computable linear orderings".Rodney G. Downey, Steffen Lempp & Guohua Wu - 2017 - Journal of Mathematical Logic 17 (2):1792002.details Logic and Philosophy of Logic Direct download (4 more) Export citation Bookmark

1