The Existence of Non-Simple Constructive Extensions of the Boolean Algebra of Clopen Sets of the Cantor Space.

Abstract

The theory of Boolean algebras provides a fertile framework for studying constructive extensions of computable structures. Unlike the case for fields and p-valued fields where extensions of the rationals are constructive if and only if they are computable, the present setting houses an abundance of computable extensions which are not constructive. Thus problems related to classifying or characterizing of the constructive extensions become especially interesting. The report discusses the following theorems: There exist non-simple constructive extensions of the Boolean algebra of clopen sets of the Cantor space.

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1972
Accession Number
AD0753821

Entities

People

  • Eugene W. Madison

Organizations

  • University of Iowa

Tags

DTIC Thesaurus Topics

  • Automata
  • Boolean Algebra
  • Logic
  • Machines

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.

Technology Areas

  • Space