Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures

DOI10.1016/0168-0072(86)90041-2zbMath0604.03014OpenAlexW2047280602MaRDI QIDQ1083446

Rodney G. Downey

Publication date: 1986

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(86)90041-2

zbMATH Keywords

lifting propertylattices of r.e. substructureslocal exchange propertyr-maximal set

Mathematics Subject Classification ID

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

Related Items (7)

The undecidability of the lattice of r. e. closed subsets of an effective topological space ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\) ⋮ Invariance in ℰ* and ℰ_{Π} ⋮ Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Degree invariance in the Π₁⁰classes ⋮ More undecidable lattices of Steinitz exchange systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-order theories of abstract dependence relations
• Maximal theories
• Recursion theory on fields and abstract dependence
• SOME REMARKS ON A THEOREM OF IRAJ KALANTARI CONCERNING CONVEXITY AND RECURSION THEORY
• The undecidability of the recursively enumerable degrees
• Decidable subspaces and recursively enumerable subspaces
• Recursion theory on algebraic structures with independent sets
• Recursively enumerable vector spaces
• Recursively enumerable sets and degrees
• Recursively enumerable Boolean algebras
• Hierarchies of Boolean algebras

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