The minimality of certain decidability conditions for Boolean algebras
From MaRDI portal
Publication:416985
DOI10.1134/S0037446612010090zbMath1252.03095MaRDI QIDQ416985
Publication date: 10 May 2012
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Boolean algebra; computable model; \(n\)-computability; computable set; decidable model; elementary characteristic of a Boolean algebra; Ershov-Tarski ideal; strongly computable model
03B25: Decidability of theories and sets of sentences
06E05: Structure theory of Boolean algebras
03C57: Computable structure theory, computable model theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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