Abstract:
We describe the 1-decidable Boolean algebras with one distinguished ideal in terms of the computability of some set of predicates on the algebra and show the minimality of the conditions obtained.
Keywords:Boolean algebra, computable model, decidable model, $n$-decidable model, bounded theories of Boolean algebras, ideal on Boolean algebras, $\mathrm{I}$-algebra.
Fulltext:
PDF file (291 kB)