Arithmetic hierarchy and ideals of enumerated Boolean algebras (Q922530): Difference between revisions

The paper is devoted to enumerable Boolean algebras of arithmetical complexity. It is proved that every \(\Pi_ 1\) Boolean algebra is recursive and every \(\Pi_{n+2}\) Boolean algebra is a \(\Sigma_{n+1}\) Boolean algebra. The complexity of quotient Boolean algebras with respect to some natural ideals is also studied.