Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras

DOI10.1112/S0024609397003548zbMath0892.03016OpenAlexW2144412048MaRDI QIDQ4354181

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

zbMATH Keywords

intervalsundecidabilityideal latticeslattice of computably enumerable setsarithmetical index seteffective boolean algebrasinvariance under automorphism

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57)

Related Items

Effectively inseparable Boolean algebras in lattices of sentences, Coding in the partial order of enumerable sets, Undecidability of the structure of the Solovay degrees of c.e. reals, Initial segments of the lattice of Π₁⁰ classes, Isomorphisms of splits of computably enumerable sets, Undecidability results for low complexity time classes, Effectively dense Boolean algebras and their applications, More undecidable lattices of Steinitz exchange systems