In this article we prove the following results: (i) Every hemimaximal set has minimal c1-degree, i.e. if B is hemimaximal and A is a c.e. set such that A≤c1B then either B≤c1A or A is computable. (ii) The sQ-degree of a c.e. set contains either only one or infinitely many c.e. c-degrees. (iii) If A,B are c.e. cylinders in the same sQ1-degree and A
Chitaia, I., Omanadze, R., Sorbi, A. (2021). Notes on conjunctive and quasi degrees. JOURNAL OF LOGIC AND COMPUTATION, 31(5), 1317-1329 [10.1093/logcom/exab026].
Notes on conjunctive and quasi degrees
Sorbi Andrea
2021-01-01
Abstract
In this article we prove the following results: (i) Every hemimaximal set has minimal c1-degree, i.e. if B is hemimaximal and A is a c.e. set such that A≤c1B then either B≤c1A or A is computable. (ii) The sQ-degree of a c.e. set contains either only one or infinitely many c.e. c-degrees. (iii) If A,B are c.e. cylinders in the same sQ1-degree and A
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
conjunctive-and-quasi.pdf
non disponibili
Descrizione: articolo
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
188.17 kB
Formato
Adobe PDF
|
188.17 kB | 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/1175465