Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
DOI10.1112/S0024609397003548zbMATH Open0892.03016OpenAlexW2144412048MaRDI QIDQ4354181FDOQ4354181
Authors: André Nies 
Publication date: 14 September 1997
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024609397003548
Recommendations
intervalsundecidabilityideal latticeslattice of computably enumerable setsarithmetical index seteffective boolean algebrasinvariance under automorphism
Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35)
Cited In (13)
- Undecidability and 1-types in intervals of the computably enumerable degrees
- On the lattice of equational classes of Boolean functions and its closed intervals
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Initial segments of the lattice of Π10 classes
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- Coding in the partial order of enumerable sets
- Computably enumerable sets and related issues
- Intervals of the Muchnik lattice
- Effectively dense Boolean algebras and their applications
- Undecidability results for low complexity time classes
- 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)
