Recursively enumerable Boolean algebras

DOI10.1016/0003-4843(78)90027-XMaRDI QIDQ4200050zbMATH OpenFDO

Authors Jeffrey Remmel

Publication date 1978

Published in Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0003-4843(78)90027-X

zbMATH Keywords

lattice of recursively enumerable subalgebrasrecursively presented Boolean algebra

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Boolean algebras (Boolean rings) (06E99)

Cited in

(12)

• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• Maximal theories
• Lattice of recursively enumerable subalgebras of a recursive Boolean algebra
• Countable thin ^0_1 classes
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Generic objects in recursion theory. II: Operations on recursive approximation spaces
• On the lattices of NP-subspaces of a polynomial time vector space over a finite field
• Degrees of recursively enumerable topological spaces
• Splitting recursively enumerable subalgebras in recursive Boolean algebras
• Recursion theory on orderings. I. A model theoretic setting
• The given
• Complexity-theoretic algebra. II: Boolean algebras

This page was built for publication: Recursively enumerable Boolean algebras

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