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

, &
Journal of Mathematical Logic 17 (2):1792002 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1142/s0219061317920027

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the complexity of the successivity relation in computable linear orderings.Rod Downey, Steffen Lempp & Guohua Wu - 2010 - Journal of Mathematical Logic 10 (1):83-99.
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.
Rodney G. Downey and Denis R. Hirschfeldt. Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, 2010, xxviii + 855 pp. [REVIEW]Laurent Bienvenu - 2012 - Bulletin of Symbolic Logic 18 (1):126-128.
Automorphisms of η-like computable linear orderings and Kierstead's conjecture.Charles M. Harris, Kyung Il Lee & S. Barry Cooper - 2016 - Mathematical Logic Quarterly 62 (6):481-506.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Coding in graphs and linear orderings.Julia F. Knight, Alexandra A. Soskova & Stefan V. Vatev - 2020 - Journal of Symbolic Logic 85 (2):673-690.
Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Review: Joseph G. Rosenstein, Linear Orderings. [REVIEW]Dale Myers - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
Review: R. G. Downey, M. R. Fellows, Parameterized Complexity. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.

Analytics

Added to PP
2017-10-21

Downloads
52 (#419,495)

6 months
4 (#1,252,858)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references