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 the normal view instead:
scientific article; zbMATH DE number 1278516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Arithmetic complexity of first-order definable subsets of recursive Boolean algebras |
scientific article; zbMATH DE number 1278516 |
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
0.9113751
0 references
0.89648145
0 references
0.8952743
0 references
0.8923957
0 references
0.88977706
0 references
0.8879134
0 references
0.8877399
0 references
0.8876408
0 references
