"On the Complexity of the Successivity Relation in Computable linear Orderings."

Rod Downey, Steffen Lempp, Guohua Wu (2010)

> Home

Details and statistics

DOI: 10.1142/S0219061310000924

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jml/DowneyLW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jml/DowneyLW10
Rod Downey, Steffen Lempp, Guohua Wu:
On the Complexity of the Successivity Relation in Computable linear Orderings. J. Math. Log. 10(1-2) (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.