Atomless Boolean algebras computable in polynomial time
From MaRDI portal
Publication:2402149
DOI10.17377/semi.2016.13.082zbMath1390.03033MaRDI QIDQ2402149
Publication date: 6 September 2017
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Boolean algebracomputable structurepolynomial time computabilityprimitive recursive structureprimitive recursive isomorphism
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57)
Related Items (3)
Effective categoricity of automatic equivalence and nested equivalence structures ⋮ The back-and-forth method and computability without delay ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY
This page was built for publication: Atomless Boolean algebras computable in polynomial time
