Recursively enumerable Boolean algebras
From MaRDI portal
Publication:4200050
DOI10.1016/0003-4843(78)90027-XzbMath0413.03027MaRDI QIDQ4200050
Publication date: 1978
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Boolean algebras (Boolean rings) (06E99) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items
Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures, Maximal theories, Lattice of recursively enumerable subalgebras of a recursive Boolean algebra, On the lattices of NP-subspaces of a polynomial time vector space over a finite field, Complexity-theoretic algebra. II: Boolean algebras, Splitting recursively enumerable subalgebras in recursive Boolean algebras, Degrees of recursively enumerable topological spaces, Countable thin \(\Pi^0_1\) classes, Generic objects in recursion theory. II: Operations on recursive approximation spaces, Recursion theory on orderings. I. A model theoretic setting, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, The given
