Atomless Boolean algebras computable in polynomial time
type: Item
instance of: scholarly article
title: Atomless Boolean algebras computable in polynomial time
zbMATH Open document ID: 1390.03033
author: P. E. Alaev
publication date: 2017-09-06T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 06E05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6770227
zbMATH Keywords: computable structure
zbMATH Keywords: Boolean algebra
zbMATH Keywords: primitive recursive structure
zbMATH Keywords: polynomial time computability
zbMATH Keywords: primitive recursive isomorphism
MaRDI profile type: Publication
DOI: 10.17377/SEMI.2016.13.082
published in: Sibirskie Elektronnye Matematicheskie Izvestiya
Recommended article: Q4669900
Recommended article: Q5465461
Recommended article: Q4946095
Recommended article: Computable Boolean algebras
Recommended article: Q5315662
Recommended article: Q3818291
Recommended article: Q4517365
Recommended article: Complexity-theoretic algebra. II: Boolean algebras
Recommended article: Q4451637
Recommended article: Q4428878
description: scientific article