Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Complexity of Orbits of Computably Enumerable Sets."

Peter Cholak, Rodney G. Downey, Leo Harrington (2008)

> Home

Details and statistics

DOI: 10.2178/BSL/1208358844

access: closed

type: Journal Article

metadata version: 2020-07-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/bsl/CholakDH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bsl/CholakDH08
Peter Cholak, Rodney G. Downey, Leo Harrington:
The Complexity of Orbits of Computably Enumerable Sets. Bull. Symb. Log. 14(1): 69-87 (2008)

a service of

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.