On some filters and ideals of the Medvedev lattice

DOI10.1007/BF01793784zbMath0704.03025MaRDI QIDQ916651

Andrea Sorbi

Publication date: 1990

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

idealsfiltersTuring degreesmass problemsdense degreesMedvedev lattice of degrees of difficultypartial degreesquotient lattice

Mathematics Subject Classification ID

Structure and representation theory of distributive lattices (06D05) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (4)

Topological aspects of the Medvedev lattice ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees ⋮ Quasi-minimal enumeration degrees and minimal Turing degrees ⋮ Sets of generator and automorphism bases for the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds for the arithmetical degrees
• Automorphism bases for degrees of unsolvability
• Some Quotient Lattices of the Medvedev Lattice
• Some remarks on the algebraic structure of the Medvedev Lattice
• Jumps of quasi-minimal enumeration degrees
• Banach–Mazur games, comeager sets and degrees of unsolvability
• Countable initial segments of the degrees of unsolvability
• Partial degrees and the density problem
• Enumeration reducibility and partial degrees

This page was built for publication: On some filters and ideals of the Medvedev lattice