Decidable Boolean algebras of characteristic (1,0,1)

MaRDI QIDQ2569574zbMATH OpenFDO

Authors P. E. Alaev

Publication date 28 October 2005

Published in Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmcomputabilitycomputable Boolean algebraconstructive structure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• scientific article; zbMATH DE number 1396732
• scientific article; zbMATH DE number 1873428
• Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
• Decidable Boolean algebras of low level

Cited in

(12)

• Decidable Boolean algebras of low level
• Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• Sufficient solvability conditions for Boolean algebras
• Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
• The minimality of certain decidability conditions for Boolean algebras
• scientific article; zbMATH DE number 1302871 (Why is no real title available?)
• scientific article; zbMATH DE number 1873428 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 1396732 (Why is no real title available?)
• Strongly constructive Boolean algebras
• A first-order completeness result about characteristic Boolean algebras in classical realizability

This page was built for publication: Decidable Boolean algebras of characteristic \((1,0,1)\)

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