Accession Number:

AD0729270

Title:

Computability of Boolean Algebras and Their Extensions.

Descriptive Note:

Technical rept.,

Corporate Author:

IOWA UNIV IOWA CITY DEPT OF MATHEMATICS

Personal Author(s):

• Alton,Donald A.
• Madison,Eugene W.

Report Date:

1971-08-01

Pagination or Media Count:

61.0

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 hn. Author

Descriptors:

• *ALGEBRA
• RECURSIVE FUNCTIONS
• MATHEMATICAL LOGIC
• SET THEORY
• AUTOMATA
• THEOREMS

Subject Categories:

• Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE