Correction to ``Undecidability of L(F_) and other lattices of r.e. substructures

DOI10.1016/0168-0072(90)90025-WMaRDI QIDQ749526zbMATH OpenOpenAlexFDO

Authors Rodney G. Downey

Publication date 1990

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-0072(90)90025-w

zbMATH Keywords

lattices of r.e. substructureslifting propertylocal exchange propertyr-maximal set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Review text

The proof of the main theorem in the original version [ibid. 32, 17-26 (1986; Zbl 0604.03014)] contained a flaw that is repaired here.

Cites work

• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures

Cited in

(5)

• Correction to: ``The other closure and complete sublocales
• The Lattice of Computably Enumerable Vector Spaces
• Degree invariance in the \(\Pi ^{0}_{1}\) classes
• More undecidable lattices of Steinitz exchange systems
• Invariance in ℰ* and ℰ_{Π}

This page was built for publication: Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749526)