M. N. Leontieva, “Strong constructivizability of Boolean algebras of elementary characteristic <nobr>$(\infty,0,0)$</nobr>”, Algebra Logika, 2014, Volume 53, Number 2,Pages <nobr>185

Strong constructivizability of Boolean algebras of elementary characteristic $(\infty,0,0)$

M. N. Leontieva^ab

^a Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia
^b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

Abstract: We give a complete description of conditions of being strongly constructivizable for Boolean algebras of elementary characteristic $(\infty,0,0)$ in terms of being computable for a sequence of canonical Ershov–Tarski predicates on Boolean algebras.

Keywords: Boolean algebra, computable model, ideals of Boolean algebra.

UDC: 510.5+510.6+512.563

Received: 29.11.2013