Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
From MaRDI portal
Publication:4354181
Recommendations
Cited in
(13)- Undecidability and 1-types in intervals of the computably enumerable degrees
- Undecidability of the structure of the Solovay degrees of c.e. reals
- On the lattice of equational classes of Boolean functions and its closed intervals
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- Initial segments of the lattice of Π10 classes
- Coding in the partial order of enumerable sets
- Computably enumerable sets and related issues
- Intervals of the Muchnik lattice
- Undecidability results for low complexity time classes
- Effectively dense Boolean algebras and their applications
- More undecidable lattices of Steinitz exchange systems
- Effectively inseparable Boolean algebras in lattices of sentences
- Isomorphisms of splits of computably enumerable sets
This page was built for publication: Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354181)