Lattice of recursively enumerable subalgebras of a recursive Boolean algebra

DOI10.1007/BF01979640zbMath0662.03039MaRDI QIDQ1113895

Sergei P. Odintsov

Publication date: 1986

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

Full work available at URL: https://eudml.org/doc/187371

zbMATH Keywords

Turing degreesrecursive Boolean algebralattice of recursively enumerable subalgebras

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Recursive isomorphism types of recursive Boolean algebras
• Recursively enumerable Boolean algebras
• On the Lattice of Recursively Enumerable Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: Lattice of recursively enumerable subalgebras of a recursive Boolean algebra