We consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are disjoint from the prime ideal generated by the dense degrees of difficulty.
Bianchini, C., Sorbi, A. (1996). A note on closed degrees of difficulty of the Medvedev lattice. MATHEMATICAL LOGIC QUARTERLY, 42(1), 127-133 [10.1002/malq.19960420111].
A note on closed degrees of difficulty of the Medvedev lattice
Sorbi A.
1996-01-01
Abstract
We consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are disjoint from the prime ideal generated by the dense degrees of difficulty.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
closed-degrees-difficulty.pdf
non disponibili
Descrizione: Articolo
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
350.53 kB
Formato
Adobe PDF
|
350.53 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/1082754