Boolean algebra approximations

DOI10.1090/S0002-9947-2014-05950-3zbMath1341.03057OpenAlexW1965920428MaRDI QIDQ3190798

Antonio Montalbán, Kenneth D. Harris

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1090/s0002-9947-2014-05950-3

zbMATH Keywords

approximationBoolean algebraback-and-forth relations\(\mathrm{low}_n\) Boolean algebra

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Cuts of linear orders ⋮ On a computable presentation of low linear orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Minimally generated Boolean algebras
• Computable structures and the hyperarithmetical hierarchy
• Computable Boolean algebras
• On the $n$-back-and-forth types of Boolean algebras
• Notes on the Jump of a Structure
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Every Low 2 Boolean Algebra has a Recursive Copy

This page was built for publication: Boolean algebra approximations