On some filters and ideals of the Medvedev lattice
From MaRDI portal
DOI10.1007/BF01793784zbMATH Open0704.03025MaRDI QIDQ916651FDOQ916651
Authors: Andrea Sorbi 
Publication date: 1990
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Recommendations
filtersidealsTuring degreesmass problemsdense degreesMedvedev lattice of degrees of difficultypartial degreesquotient lattice
Structure and representation theory of distributive lattices (06D05) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumeration reducibility and partial degrees
- Some remarks on the algebraic structure of the Medvedev Lattice
- Some Quotient Lattices of the Medvedev Lattice
- Jumps of quasi-minimal enumeration degrees
- Countable initial segments of the degrees of unsolvability
- Banach–Mazur games, comeager sets and degrees of unsolvability
- Partial degrees and the density problem
- Upper bounds for the arithmetical degrees
- Automorphism bases for degrees of unsolvability
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Characterizing the join-irreducible Medvedev degrees
- Topological aspects of the Medvedev lattice
- Sets of generator and automorphism bases for the enumeration degrees
- Some remarks on the algebraic structure of the Medvedev Lattice
- Some Quotient Lattices of the Medvedev Lattice
- Quasi-minimal enumeration degrees and minimal Turing degrees
- Comparing the degrees of enumerability and the closed Medvedev degrees
This page was built for publication: On some filters and ideals of the Medvedev lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916651)
