When searching online databases, you often get too many or too few results. Identifying keywords or phrases and then connecting them using Boolean operators (AND, OR, and NOT), along with the other ...
In this paper we investigate computable isomorphisms of Boolean algebras with operators (BAOs). We prove that there are examples of polymodal Boolean algebras with finitely many computable isomorphism ...
当前正在显示可能无法访问的结果。
隐藏无法访问的结果
反馈