The minimality of certain decidability conditions for Boolean algebras

DOI10.1134/S0037446612010090zbMath1252.03095MaRDI QIDQ416985

M. N. Leontyeva

Publication date: 10 May 2012

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Boolean algebracomputable model\(n\)-computabilitycomputable setdecidable modelelementary characteristic of a Boolean algebraErshov-Tarski idealstrongly computable model

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57)

Related Items (1)

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

Cites Work

• Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable
• Some properties of the constructivization of Boolean algebras
• Restricted theories of constructive Boolean algebras
• Computable structures and the hyperarithmetical hierarchy
• The existence of strongly computable representations in the class of Boolean algebras
• Strongly constructive Boolean algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimality of certain decidability conditions for Boolean algebras