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

DOI10.1007/S10958-012-1000-3zbMath1249.03059OpenAlexW2051452805MaRDI QIDQ2898949

M. N. Leontyeva

Publication date: 13 July 2012

Published in: Journal of Mathematical Sciences (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)

Related Items (2)

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)\)

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