On some filters and ideals of the Medvedev lattice
From MaRDI portal
Publication:916651
DOI10.1007/BF01793784zbMath0704.03025MaRDI QIDQ916651
Publication date: 1990
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
ideals; filters; Turing degrees; mass problems; dense degrees; Medvedev lattice of degrees of difficulty; partial degrees; quotient lattice
06D05: Structure and representation theory of distributive lattices
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Topological aspects of the Medvedev lattice, Sets of generator and automorphism bases for the enumeration degrees, Quasi-minimal enumeration degrees and minimal Turing degrees, Comparing the degrees of enumerability and the closed Medvedev 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