We survey some open problems in the enumeration degrees. The problems fall into the following three categories: Global properties of the enumeration degrees and their local structure, the interplay between structural properties of sets and degree-theoretic properties, and the context of the enumeration degrees within the Medvedev lattice.
Sorbi, A. (2000). Open problems in the enumeration degrees. In P.A. Chola, S. Lempp, M. Lerman, R.A. Shore (a cura di), Computability Theory and its Applications (pp. 309-320). Providence : American Mathematical Society.
Open problems in the enumeration degrees
Sorbi Andrea
2000-01-01
Abstract
We survey some open problems in the enumeration degrees. The problems fall into the following three categories: Global properties of the enumeration degrees and their local structure, the interplay between structural properties of sets and degree-theoretic properties, and the context of the enumeration degrees within the Medvedev lattice.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
open-problems.pdf
non disponibili
Descrizione: Articolo
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
1.22 MB
Formato
Adobe PDF
|
1.22 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/1082957