Computability of Boolean Algebras and Their Extensions.
Abstract
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 h(n)). (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1971
- Accession Number
- AD0729270
Entities
People
- Donald A. Alton
- Eugene W. Madison
Organizations
- University of Iowa