The existence of strongly computable representations in the class of Boolean algebras

DOI10.1134/S1064562412040084zbMath1266.03049MaRDI QIDQ1761055

M. N. Leontyeva

Publication date: 15 November 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (2)

The minimality of certain decidability conditions for Boolean algebras ⋮ Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)

Cites Work

• Some properties of the constructivization of Boolean algebras
• Computable structures and the hyperarithmetical hierarchy
• Unnamed Item

This page was built for publication: The existence of strongly computable representations in the class of Boolean algebras