Computability of Boolean Algebras and Their Extensions.
IOWA UNIV IOWA CITY DEPT OF MATHEMATICS
Pagination or Media Count:
A Boolean algebra is computable if there is a one-to-one enumeration O sub n sub n epsilon N of its domain which associates recursive functions with sup, inf, and complement. A computable Boolean algebra B with enumeration U sub n is a constructive extension of its computable sub-algebra U with enumeration O sub n if there is a recursive function h such that O sub n U sub hn. Author
- Theoretical Mathematics