Atomless Boolean algebras computable in polynomial time (Q2402149)
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: Atomless Boolean algebras computable in polynomial time |
scientific article; zbMATH DE number 6770227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Atomless Boolean algebras computable in polynomial time |
scientific article; zbMATH DE number 6770227 |
Statements
Atomless Boolean algebras computable in polynomial time (English)
0 references
6 September 2017
0 references
computable structure
0 references
Boolean algebra
0 references
primitive recursive structure
0 references
polynomial time computability
0 references
primitive recursive isomorphism
0 references
0 references
0.87642074
0 references
