On the triple jump of the set of atoms of a Boolean algebra

DOI10.1090/S0002-9939-08-09248-4zbMath1140.03028OpenAlexW2074554828MaRDI QIDQ3508087

Antonio Montalbán

Publication date: 27 June 2008

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-08-09248-4

zbMATH Keywords

atomBoolean algebrarelationcomputablerecursivedegree spectrumhigh\(_3\)

Mathematics Subject Classification ID

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

Related Items (1)

Computable Heyting algebras with distinguished atoms and coatoms

Cites Work

• Every recursive Boolean algebra is isomorphic to one with incomplete atoms
• Computable Boolean algebras
• Recursive isomorphism types of recursive Boolean algebras
• Recursive Boolean algebras with recursive atoms
• Recursive Linear Orders with Incomplete Successivities
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Every Low 2 Boolean Algebra has a Recursive Copy
• Unnamed Item
• Unnamed Item

This page was built for publication: On the triple jump of the set of atoms of a Boolean algebra