Arithmetic hierarchy and ideals of enumerated Boolean algebras (Q922530)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4168665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Arithmetic hierarchy and ideals of enumerated Boolean algebras |
scientific article; zbMATH DE number 4168665 |
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.8152080178260803
0 references
0.7786926627159119
0 references
