Decidable Boolean algebras of low level
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3779289 (Why is no real title available?)
- scientific article; zbMATH DE number 41688 (Why is no real title available?)
- scientific article; zbMATH DE number 3458610 (Why is no real title available?)
- scientific article; zbMATH DE number 3484041 (Why is no real title available?)
- scientific article; zbMATH DE number 3561336 (Why is no real title available?)
- scientific article; zbMATH DE number 3437137 (Why is no real title available?)
- Arithmetic hierarchy and ideals of enumerated Boolean algebras
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Model theory.
- Recursive Boolean algebras with recursive atoms
- Recursive isomorphism types of recursive Boolean algebras
- Strong constructibility of Boolean algebras of elementary characteristic (1,1,0)
Cited in
(6)- Every Low 2 Boolean Algebra has a Recursive Copy
- Sufficient solvability conditions for Boolean algebras
- The minimality of certain decidability conditions for Boolean algebras
- Decidable Boolean algebras of characteristic \((1,0,1)\)
- Deciding the word problem in pure double Boolean algebras
- Strongly constructive Boolean algebras
This page was built for publication: Decidable Boolean algebras of low level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295398)