The lattice of recursively enumerable substructures of an effective closure system

DOI10.1007/BF00739411zbMath0848.03024OpenAlexW2039202118MaRDI QIDQ1918795

S. L. Shokhor

Publication date: 15 October 1996

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00739411

zbMATH Keywords

r.e. degreesrecursive Boolean algebralattice of r.e. sets\(r\)-maximal subalgebraslattice of superstructuresrecursive substructure of an effective closure system

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Recursion theory on algebraic structures with independent sets
• On the Lattice of Recursively Enumerable Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: The lattice of recursively enumerable substructures of an effective closure system