Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
From MaRDI portal
Publication:2342305
DOI10.1007/s10469-014-9276-7zbMath1323.03046OpenAlexW1978577692MaRDI QIDQ2342305
Publication date: 11 May 2015
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-014-9276-7
Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57)
Cites Work
- The minimality of certain decidability conditions for Boolean algebras
- Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable
- The existence of strongly computable representations in the class of Boolean algebras
- Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements
- Strongly constructive Boolean algebras
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)