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

DOI10.1007/S10469-011-9126-9MaRDI QIDQ695763zbMATH OpenOpenAlexFDO

Authors M. N. Leont'eva

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 algebracomputable modelcomputability

Mathematics Subject Classification ID

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

Recommendations

• Boolean algebras of elementary characteristic \((1, 0, 1)\) with computable set of atoms and computable ideal of atomic elements
• Publication:4936684
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
• scientific article; zbMATH DE number 934728

Cites work

• scientific article; zbMATH DE number 3561336 (Why is no real title available?)
• scientific article; zbMATH DE number 1285473 (Why is no real title available?)
• scientific article; zbMATH DE number 2154083 (Why is no real title available?)
• scientific article; zbMATH DE number 2154086 (Why is no real title available?)
• scientific article; zbMATH DE number 2154090 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 3316934 (Why is no real title available?)
• scientific article; zbMATH DE number 3093420 (Why is no real title available?)
• Boolean algebras of elementary characteristic \((1, 0, 1)\) with computable set of atoms and computable ideal of atomic elements
• Hierarchies of Boolean algebras

Cited in

(7)

• Boolean algebras, Tarski invariants, and index sets
• The existence of strongly computable representations in the class of 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
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• scientific article; zbMATH DE number 2154083 (Why is no real title available?)
• Boolean algebras realized by c.e. equivalence relations

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

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