Atomless Boolean algebras computable in polynomial time

DOI10.17377/SEMI.2016.13.082MaRDI QIDQ2402149zbMATH OpenFDO

Authors P. E. Alaev

Publication date 6 September 2017

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17377/SEMI.2016.13.082

zbMATH Keywords

Boolean algebracomputable structurepolynomial time computabilityprimitive recursive isomorphismprimitive recursive structure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15) Structure theory of Boolean algebras (06E05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2157312
• scientific article; zbMATH DE number 2193711
• scientific article; zbMATH DE number 1421070
• Computable Boolean algebras
• scientific article; zbMATH DE number 2203952
• scientific article; zbMATH DE number 4089517
• scientific article; zbMATH DE number 1534579
• Complexity-theoretic algebra. II: Boolean algebras
• scientific article; zbMATH DE number 2047481
• scientific article; zbMATH DE number 1984513

Cited in

(7)

• Categoricity for primitive recursive and polynomial Boolean algebras
• A complete Boolean algebra that has no proper atomless complete subalgebra
• Effective categoricity of automatic equivalence and nested equivalence structures
• The back-and-forth method and computability without delay
• scientific article; zbMATH DE number 2157312 (Why is no real title available?)
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)
• FOUNDATIONS OF ONLINE STRUCTURE THEORY

This page was built for publication: Atomless Boolean algebras computable in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402149)