"Upper bounds on ideals in the computably enumerable Turing degrees."

George Barmpalias, André Nies (2011)

> Home

Details and statistics

DOI: 10.1016/J.APAL.2010.12.005

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/BarmpaliasN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/BarmpaliasN11
George Barmpalias, André Nies:
Upper bounds on ideals in the computably enumerable Turing degrees. Ann. Pure Appl. Log. 162(6): 465-473 (2011)

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.