We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one can embed every countable partial order.
Sorbi, A. (2002). Embeddings into the enumeration degrees. In Proceedings of the International Conference "Logic and Applications'', honouring Yu. L. Ershov on his 60th birthday; and of the International Conference on Mathematical Logic, honoring A. L. Malt'sev on his 90th birthday anniversary and the 275th anniversary of the Russian Academy of Sciences (pp.144-164). Novosibirsk State University.
Embeddings into the enumeration degrees
SORBI, ANDREA
2002-01-01
Abstract
We give a proof of the fact that in every nonempty interval of $\Sigma^0_2$ enumeration degrees one can embed every countable partial order.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
embedding-novosibirsk.pdf
non disponibili
Descrizione: file principale
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
3.31 MB
Formato
Adobe PDF
|
3.31 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/506742