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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:37, 5 March 2024

scientific article
Language Label Description Also known as
English
Arithmetic hierarchy and ideals of enumerated Boolean algebras
scientific article

    Statements

    Arithmetic hierarchy and ideals of enumerated Boolean algebras (English)
    0 references
    1989
    0 references
    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.
    0 references
    enumerable Boolean algebras
    0 references
    arithmetical complexity
    0 references
    quotient Boolean algebras
    0 references
    ideals
    0 references
    0 references
    0 references

    Identifiers