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

DOI10.1007/S10958-012-1000-3MaRDI QIDQ2898949zbMATH OpenOpenAlexFDO

Authors M. N. Leont'eva

Publication date 13 July 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/vngu/v10/i1/p65

zbMATH Keywords

Boolean algebracomputable model\(n\)-computabilitycomputable setErshov-Tarski idealstrongly computable modelFrechet idealelementary characteristic of Boolean algebra

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)\) whose set of atoms and Ershov-Tarski ideal are computable
• Publication:4936684
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• scientific article; zbMATH DE number 1936726
• Decidable Boolean algebras of characteristic \((1,0,1)\)

Cited in

(18)

• scientific article; zbMATH DE number 1936726 (Why is no real title available?)
• scientific article; zbMATH DE number 2154083 (Why is no real title available?)
• scientific article; zbMATH DE number 1396732 (Why is no real title available?)
• Boolean algebras realized by c.e. equivalence relations
• Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable
• Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
• Boolean algebras, Tarski invariants, and index sets
• Boolean algebras with finite families of computable automorphisms
• Sufficient solvability conditions for Boolean algebras
• scientific article; zbMATH DE number 1746562 (Why is no real title available?)
• The existence of strongly computable representations in the class of Boolean algebras
• Isols and generalized Boolean algebras
• Computably categorical Boolean algebras enriched by ideals and atoms
• Depth zero Boolean algebras
• Complexity of some natural problems on the class of computable \(I\)-algebras
• Computable Boolean algebras
• Boolean algebras with distinguished endomorphisms and generating trees
• Computable isomorphisms of Boolean algebras with operators

This page was built for publication: Boolean algebras of elementary characteristic \((1, 0, 1)\) with computable set of atoms and computable ideal of atomic elements

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