Sufficient solvability conditions for Boolean algebras

zbMATH Open1249.03060MaRDI QIDQ2895849FDOQ2895849

M. N. Leont'eva

Publication date: 13 July 2012

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Structure theory of Boolean algebras (06E05)

Cited In (1)

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

This page was built for publication: Sufficient solvability conditions for Boolean algebras

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