Arithmetic complexity of first-order definable subsets of recursive Boolean algebras (Q1284381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Arithmetic complexity of first-order definable subsets of recursive Boolean algebras |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arithmetic complexity of first-order definable subsets of recursive Boolean algebras |
scientific article |
Statements
Arithmetic complexity of first-order definable subsets of recursive Boolean algebras (English)
0 references
26 April 1999
0 references
arithmetic hierarchy
0 references
prime Boolean algebras
0 references
dense Boolean algebras
0 references
arithmetic complexity
0 references
recursive Boolean algebras
0 references
saturated Boolean algebras
0 references
