Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
From MaRDI portal
Publication:4354181
DOI10.1112/S0024609397003548zbMath0892.03016MaRDI QIDQ4354181
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
intervals; undecidability; ideal lattices; lattice of computably enumerable sets; arithmetical index set; effective boolean algebras; invariance under automorphism
03D35: Undecidability and degrees of sets of sentences
03D25: Recursively (computably) enumerable sets and degrees
03C57: Computable structure theory, computable model theory
Related Items
Initial segments of the lattice of Π10 classes, Effectively dense Boolean algebras and their applications, Isomorphisms of splits of computably enumerable sets, Undecidability of the structure of the Solovay degrees of c.e. reals, Coding in the partial order of enumerable sets, Undecidability results for low complexity time classes, Effectively inseparable Boolean algebras in lattices of sentences, More undecidable lattices of Steinitz exchange systems