DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click HERE
to register or log in.
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
APPROVED FOR PUBLIC RELEASE