Recursive Homogeneous Boolean Algebras |
| |
Authors: | S Yu Podzorov |
| |
Institution: | (1) Pirogova 20/1, 304-3, Novosibirsk, 630090 |
| |
Abstract: | Isomorphism types of countable homogeneous Boolean algebras are described in 1], in which too is settled the question of whether such algebras are decidable. Precisely, a countable homogeneous Boolean algebra has a decidable presentation iff the set by which an isomorphism type of that algebra is characterized belongs to a class
of the arithmetic hierarchy. The problem of obtaining a characterization for homogeneous Boolean algebras which have a recursive presentation remained open. Partially, here we resolve this problem, viz., estimate an exact upper and an exact lower bounds for the set which an isomorphism type of such any algebra is characterized by in terms of the Feiner hierarchy. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|