On some filters and ideals of the Medvedev lattice
type: Item
instance of: scholarly article
title: On some filters and ideals of the Medvedev lattice
zbMATH Open document ID: 0704.03025
DOI: 10.1007/BF01793784
author: Andrea Sorbi
published in: Archive for Mathematical Logic
publication date: 1990-01-01T00:00:00Z
review text: Let \(M\) be the Medvedev lattice of degrees of difficulty. This paper investigates some filters and ideals of \(M\). Given a property \(P\) of mass problems (i.e. of sets of functions of one variable from the set of natural numbers into itself), let us say that a degree of difficulty \({\mathfrak a}\) has property \(P\), if \({\mathfrak a}\) contains a mass problem having that property. Amongst the ideals and filters of \(M\) considered here are: the ideal generated by the dense degrees; the filter generated by the non-zero finite degrees; the filter generated by the non-zero discrete degrees; the filter generated by the non-zero countable degrees; the filter generated by the non-zero degrees with countable basis; the filter generated by the non-zero degrees of enumerability. Most of these filters and ideals were introduced by \textit{E. Z. Dyment} [Mat. Sb., Nov. Ser. 101(143), 360--379 (1976; Zbl 0353.02019)]. None of these filters and ideals is principal. It is shown in the paper that none of these filters is prime, whereas the ideal generated by the dense degrees is prime. Dividing \(M\) by any of these filters, we get a quotient lattice, whose cardinality is shown to be the same as the cardinality of \(M\). Some facts about the structure of the Turing degrees and the partial degrees are occasionally pointed out. For instance, it is shown that any non-zero partial degree bounds a quasi-minimal partial degree.
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 06D05
zbMATH DE Number: 4154427
zbMATH Keywords: Medvedev lattice of degrees of difficulty
zbMATH Keywords: filters
zbMATH Keywords: ideals
zbMATH Keywords: mass problems
zbMATH Keywords: dense degrees
zbMATH Keywords: quotient lattice
zbMATH Keywords: Turing degrees
zbMATH Keywords: partial degrees
MaRDI profile type: Publication
cites work: Q4083730
cites work: Enumeration reducibility and partial degrees
cites work: Partial degrees and the density problem
cites work: Q4123306
cites work: Automorphism bases for degrees of unsolvability
cites work: Q5831322
cites work: Countable initial segments of the degrees of unsolvability
cites work: Upper bounds for the arithmetical degrees
cites work: Jumps of quasi-minimal enumeration degrees
cites work: Q5573961
cites work: Some remarks on the algebraic structure of the Medvedev Lattice
cites work: Some Quotient Lattices of the Medvedev Lattice
cites work: Banach–Mazur games, comeager sets and degrees of unsolvability
description: scientific article; zbMATH DE number 4154427