| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662013 | Annals of Pure and Applied Logic | 2012 | 15 Pages |
Abstract
We describe computably categorical Boolean algebras whose language is enriched by one-place predicates that distinguish a finite set of ideals and atoms with respect to some ideals in this set.
► We investigate Boolean algebras in an enriched language. ► The language is enriched by a finite number of ideals and sets of atoms w.r.t. ideals. ► We algebraically describe computably categorical structures of this form.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
P.E. Alaev,