Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable

DOI10.1007/S10469-011-9126-9zbMath1345.03064OpenAlexW2028362788MaRDI QIDQ695763

M. N. Leontyeva

Publication date: 17 December 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-011-9126-9

zbMATH Keywords

Boolean algebracomputabilitycomputable model

Mathematics Subject Classification ID

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

Related Items (2)

The minimality of certain decidability conditions for Boolean algebras ⋮ Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)

Cites Work

• Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
• Hierarchies of Boolean algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable